#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <string.h>
#include <time.h>

#define clear() printf("\033[H\033[J")

// Checks if the array contains the number from the input variable
int duplicate(int array[100], int number){
    int answer = 0, i;

    for (i = 0; i < 100; i++) {
        if (array[i] == number) {
            answer = 1;
        }
    }
    return answer;
}

// Prints the array of number in the correct format
void print(int array[]){
    int i;
    int rowsum = 0, val = 0, col, columsum[10] = {0}, row;
    for (row = 0; row < 10; row++) {
        for (col = 0; col < 10; col++) {
            printf("%i ", array[val]);
            rowsum += array[val];
            columsum[col] += array[val];

            val++;
        }
        printf(" :: Rowsum of row %i is %i\n",row + 1,rowsum);
        rowsum = 0;
    }

    printf("Kolumnsum: \n");
    for (i = 0; i < 10; i++)
    {
        printf("Kolumn %i %i\n", i + 1, columsum[i]);
    }
}

// Sorts the array from lowest number to the highest
int * sort(int array[]) {
    int i, j, temp;

    for (i = 0; i < 100 - 1; i++) {
        for (j = 0; j < 100 - 1; j++)
        {
            if (array[j]>array[j+1])
            {
                temp = array[j];
                array[j] = array[j + 1];
                array[j + 1] = temp;
            }
        }
    }
    return array;
}

// Quicksort compare function
/*
int cmpfunc (const void * a, const void * b) {
    return (* (int*) a - *(int*) b);
}
*/

// Calculates and prints array values
void count(int array[])
{
    int i, sum = 0;
    for (i = 0; i < 100; i++)
    {
        sum += array[i];
    }
    sum /= 100;
    printf("Average value: %i\n", sum);
    printf("Median: %i\n", (array[49] + array[50]) / 2);
    printf("Max value: %i\n", array[99]);
    printf("Minimum value: %i\n", array[0]);
}

// Binary seach function
void search (int array[], int comp)
{
    int high = 100, low = 0, mid;

    while ((high - low) > 1) {

        mid = (high + low) / 2;

        if (comp >= array[mid]) {
            low = mid;
        }

        else {
            high = mid;
        }
    }

    // Returns the searched value if it exist
    if (comp == array[low]) {
        printf("Number searched: %i found on position %i\n", comp, low + 1);
        }

    //Returns a faulty value telling the code that the searched number does not exist
    else {
        printf("Number not found: %i\n", comp);
        }
}

// Clears the console after you pressed a menuchoice
void clrscr()
{
    system("@cls||clear");
}

int main(){

    // Initialzing some variables
    int number, max = 800, min = 100, input, value = 0;

    // Array for numbers
    int unsorted_numbers[100], sorted_numbers[100];

    // Check values
    int check1 = 0, check2 = 0;

    do {
        // Menu
        printf(": : : : : : : : : : : : \n");
        printf(": : : : M E N U : : : : \n");
        printf("1. Print out 100 random numbers between 100 and 900.\n");
        printf("2. Sort the randomized numbers and print them.\n");
        printf("3. Print out calculations based on these 100 randomized numbers.\n");
        printf("4. Search for a number: \n");
        printf("Enter '0' to exit\n");
        printf("Enter your menuchoice: ");
        scanf("%i", &input);
        printf("\n");

        switch (input) {
            case 1:
                // Seed for the random number generator
                srand((int)time(NULL));

                // Adds random number between min and max, excludes duplicates
                int i, j;
                for (i = 0; i < 100; i++) {
                    number = rand() % max + min;

                    while (duplicate(unsorted_numbers, number) == 1) {
                        number = rand() % max + min;
                    }
                    unsorted_numbers[i] = number;
                }

                // Printing unsorted array (1)
                printf("Unsorted array: \n");
                print(unsorted_numbers);
                printf("\n");

                printf("\n");
                check1=1;
                break;

            case 2:
                if (check1 == 1){

                    // Copying the unsorted list before modifying
                    for (j = 0; j < sizeof(unsorted_numbers)/sizeof(int); j++) {
                        sorted_numbers[j] = unsorted_numbers[j];
                    }

                    // Sorting and printing the array (2)
                    printf("Sorted array: \n");
                    sort(sorted_numbers);
                    //qsort(sorted_numbers, 100, sizeof(int), cmpfunc);
                    print(sorted_numbers);
                    printf("\n");
                    check2=1;
                }
                printf("Enter another number case 2\n");
                break;

            case 3:
                if (check2 == 1){

                    // Prints out Calculations (3)
                    count(sorted_numbers);
                    printf("\n");
                }
                printf("Enter another number case 3\n");
                break;

            case 4:
                // Binary search for numbers (4)
                if (check2 == 1){
                    printf("Search for a number: ");
                    scanf("%i", &value);
                    search(sorted_numbers, value);
                    printf("\n");
                }
                printf("Enter another number case 4\n");
                break;

            default:
                if (input <= 4 && input != 0){
                    printf("No menu choice for that number\n");
                    printf("\n");
                }
                else if (input > 4){
                    printf("You have to enter a number between 1-4.\n");
                    printf("\n");
                }
                else if (input == 0){
                    printf("Exiting program.......\n");
                    printf("\n");
                }

                break;
        }

    } while (input != 0);

    return 0;
}