Nadui_LAB3

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


void genNumtoFile(void);
void linearSearch(void);
void quicksort(int values[10], int f, int l);
void saveFile(void);
//void binarySearch(void);

int totalNo = 6, values[10];

int main() {

    int choice;

    time_t start, end;
    start = time(NULL);

    while (1){
        printf("Choose your option\n");
        printf("1> To Generate Numbers\n");
        printf("2> Run Linear Search\n");
        printf("3> Run Quick SORT\n");
        printf("4> Run Binary Search\n");
        printf("5> Save to file\n");
        printf("6> Exit\n");

        end = time(NULL);
        double timePassed = difftime(end, start);


        scanf("%d", &choice);


        switch (choice){

        case 1:
            genNumtoFile();
            break;
        case 2:
            linearSearch();
            printf("Linear search time taken: %.2f seconds\n", timePassed);
            break;
        case 3:
            quicksort(values, 0, totalNo);
            break;
        case 4:
            //binarySearch();
            break;
        case 5:
            saveFile();
            break;
        case 6:
            exit(0);

        }
    }
}




void genNumtoFile(){

    int i;

    FILE *fp;
    errno_t err = fopen_s(&fp, "ValuesGenerated.txt", "w");

    for (i = 0; i<totalNo; i++){
        values[i] = rand() % 1000;
        fprintf_s(fp, "%d\n", values[i]);

    }

    fclose(fp);

    printf("Rand. Generated No are:\n\n");
    for (i=0; i<totalNo; i++){
    printf("\t%d\n", values[i]);
    }
}


void linearSearch(){

    int i, key;

    printf("What no. you wana search?\n");
    scanf("%d", &key);

    for (i = 1; i<totalNo; i++){
        if (values[i] == key){
            printf("Found!\n");
            break;

        }
        else printf("Not found!\n");
        break;
    }

    /*if (i>totalNo){
        printf("Not Found!\n");
    }*/

}









void saveFile (){

int i;

FILE *fp;
errno_t err = fopen_s(&fp, "ValuesGenerated.txt","w");

for (i=0; i<totalNo; i++){
fprintf_s(fp, "%d\n", values[i]);

}

fclose(fp);
}



void quicksort(int values[10], int f, int l){

    int j, i, tnp;

    if (l> f){

        i = f + 1;
        j = l;

        while (j >= i){

            while (values[f] >values[i]){
                i = i + 1;
            }

            while (values[f]< values[j]){
                j = j - 1;
            }

            if (j >= i){

                tnp = values[i];
                values[i] = values[j];
                values[j] = tnp;

                i = i + 1;
                j = j - 1;

            }

        }

        tnp = values[f];
        values[f] = values[j];
        values[j] = tnp;

        quicksort(values, f, j - 1);
        quicksort(values, j + 1, l);

    }


    printf("Sorted values are: \n\n");
    for (i = 0; i<totalNo; i++){
        printf("%d\n", values[i]);
    }
}