Notes

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

int n,*a;
void display();
void generate();
void sortInAsc();
void sortInDesc();
void analyzeBest();
void quickSort2(int, int);
void analyzeWorst();
//void analyzeAverage();
void quickSortAsc(int, int);
int partition (int, int);
void swap(int*, int*);

int main()
{
int ch;
while(-1) {
printf("Enter your choice:n");
printf("0-Quitn");
printf("1-Generate n numbers and store an arrayn");
printf("2-Sort the array in ascending ordern");
printf("3-Sort the array in descending ordern");
printf("4-Analyse Best Casen");
printf("5-Analyze WORST CASEn");
printf("6-Analyze AVERAGE CASEn");
scanf("%d",&ch);
switch(ch) {
case 0: exit(-1);
break;
case 1: generate();
break;
case 2: sortInAsc();
break;
case 3: sortInDesc();
break;
case 4: analyzeBest();
break;
case 5: analyzeWorst();
break;
case 6: //analyzeAverage();
break;
default: printf("Invalid Choice");
break;
}
}
return 0;
}
void generate()
{
int i;
printf("Enter the size of the array: ");
scanf("%d", &n);
a = (int*) malloc (n*sizeof(int));
for(i=0;i<n;i++)
*(a+i) = rand() % 80;
printf("Random Array Generatedn");
display();
}
void display()
{
int i;
printf("The Array Would be: {");
for(i=0;i<n;i++)
printf("%d ,", *(a+i));
printf("}nnn");
}
void sortInAsc()
{
printf("Sorting the array In Ascendingn");
quickSortAsc(0,n-1);
display();
}


void quickSortAsc(int low, int high)
{
if (low < high)
{
int pi = partition(low, high);
quickSort1(low, pi - 1);
quickSort1(pi + 1, high);
}
}
int partition (int low, int high)
{
int pivot = a[high]; // pivot
int i = (low - 1); // Index of smaller element

for (int j = low; j <= high- 1; j++)
{
// If current element is smaller than or
// equal to pivot
if (a[j] <= pivot)
{
i++; // increment index of smaller element
swap(&a[i], &a[j]);
}
}
swap(&a[i + 1], &a[high]);
return (i + 1);
}
void swap(int* a, int* b)
{
int t = *a;
*a = *b;
*b = t;
}

void analyzeBest()
{
clock_t start, end;
double timeUsed;
start = clock();
sortInAsc();
end = clock();
timeUsed = ((double) (end - start)) / CLOCKS_PER_SEC;
printf("For BEST CASE, time analysis is %fn", timeUsed);
}

void analyzeWorst()
{
clock_t start, end;
double timeUsed;
start = clock();
sortInDesc();
end = clock();
timeUsed = ((double) (end - start)) / CLOCKS_PER_SEC;
printf("For WORST CASE, time analysis is %fn", timeUsed);
}

/*void sortInDesc()
{
printf("Sorting the array In Descendingn");
quickSort2(n-1,0);
display();
}*/Write a note in this area. It's really easy to share with others. Click here ...