Data Structures and Algorithm Analysis
Quick Sort in C Language
//gautam007.medium.com
#include<stdio.h>
int cc = 0;void quicksort(int number[25],int first,int last){
int i, j, pivot, temp;if(first<last){
pivot=first;
i=first;
j=last;while(i<j){
while(number[i]<=number[pivot]&&i<last)
i++;
while(number[j]>number[pivot])
j — ;
if(i<j){
temp=number[i];
number[i]=number[j];
number[j]=temp;
}
}temp=number[pivot];
number[pivot]=number[j];
number[j]=temp;
cc++;
quicksort(number,first,j-1);
cc++;
quicksort(number,j+1,last);}
}int main(){
int i, count, number[25];printf(“Sorting Algorithm: Quick Sort >>\n\n”);
printf(“Enter Number of Elements: “);
scanf(“%d”,&count);printf(“Enter Elements: \n”);
for(i=0;i<count;i++)
scanf(“%d”,&number[i]);cc++;
quicksort(number,0,count-1);printf(“\nSorted Elements are as Follow: “);
for(i=0;i<count;i++)
printf(“\n%d”,number[i]);printf(“\n\nRequired Fuction Calls to Sort List with %d elements is: %d”,count,cc);
}
