Notes

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

int n,*a;
void display();
void generate();
void SortInAsc();
void SortInDesc();
void AnalyzeBest();
void AnalyzeWorst();
void AnalyzeAverage();
void mergeSortAsc(int, int);
void mergeAsc(int, int, int);
void mergeSortDesc(int, int);
void mergeDesc(int, int, int);

int main()
{
int ch;
while(-1)
{
printf("Enter your Choice:n");
printf("0 - Quitn");
printf("1 - Generate n number of values & store them in arrayn");
printf("2 - Sort in Ascending ordern");
printf("3 - Sort in Descending ordern");
printf("4 - Analyze 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 Choicen");
break;
}
}
return 0;
}
void generate()
{
int i;
printf("Enter the value for n: ");
scanf("%d", &n);
a = (int *) malloc (n*sizeof(int));
printf("Entering Random values.n");
for(i=0;i<n;i++)
*(a+i) = rand() % 80;
display();
}
void display()
{
int i;
printf("Displaying Values.n The array is {");
for(i=0;i<n;i++)
printf("%d , ",*(a+i));
printf("} n n");
}
void SortInAsc()
{
printf("Sorting In Ascending Order using Merge Sortn");
mergeSortAsc(0,n-1);
display();
}
void mergeSortAsc(int l, int r)
{
if (l < r)
{
int m = l+(r-l)/2;
mergeSortAsc(l, m);
mergeSortAsc(m+1, r);
mergeAsc(l, m, r);
}
}
void mergeAsc(int l, int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1; i++)
L[i] = *(a+(l + i));
for (j = 0; j < n2; j++)
R[j] = *(a+(m + 1+ j));
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
*(a+k) = L[i];
i++;
}
else
{
*(a+k) = R[j];
j++;
}
k++;
}
while (i < n1)
{
*(a+k) = L[i];
i++;
k++;
}
while (j < n2)
{
*(a+k) = R[j];
j++;
k++;
}
}
void SortInDesc()
{
printf("Sorting In Descending Order using Merge Sortn");
mergeSortDesc(0,n-1);
display();
}
void mergeSortDesc(int l, int r)
{
if (l < r)
{
int m = l+(r-l)/2;
mergeSortDesc(l, m);
mergeSortDesc(m+1, r);
mergeDesc(l, m, r);
}
}
void mergeDesc(int l, int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1; i++)
L[i] = *(a+(l + i));
for (j = 0; j < n2; j++)
R[j] = *(a+(m + 1+ j));
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2)
{
if (L[i] >= R[j])
{
*(a+k) = L[i];
i++;
}
else
{
*(a+k) = R[j];
j++;
}
k++;
}
while (i < n1)
{
*(a+k) = L[i];
i++;
k++;
}
while (j < n2)
{
*(a+k) = R[j];
j++;
k++;
}
}
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 AnalyzeAverage();
{
}
Write a note in this area. It's really easy to share with others. Click here ...