### Program 337 : Quick Sort

Program 337 : Quick Sort

```#include<stdio.h>
void QuickSort(int array[],int start,int end);
main()
{
int i,j,array[100],num;
printf("Enter Number of Elements in Array\n");
scanf("%d",&num);
printf("Enter Elements of Array\n");
for(i=0;i<num;i++)
scanf("%d",&array[i]);
QuickSort(array,0,num);
printf("Array after Sorting\n");
for(i=0;i<num;i++)
printf("%d ",array[i]);
printf("\n");
}

void QuickSort(int array[],int start,int end)
{
int index=start,i,pivot=array[end],temp;//taking the last number in array as pivot
if(start<end)
{
for(i=start;i<end;i++)
{
if(array[i]<=pivot)//swapping index element and element at ith position if ith element is lesser than pivot element
{
temp=array[i];
array[i]=array[index];
array[index]=temp;
index++;
}
}
//finally after this loop we will get the position to interchange the pivot with index so that all the
//elements greater than pivot wil be right side and lesser than pivot will be left side
temp=array[index];
array[index]=array[end];//we are taking  end element as pivot every time the quick sort function is called
array[end]=temp;
QuickSort(array,start,index-1);
QuickSort(array,index+1,end);
}

}

```
Explanation:
//Coming Soon

Output:

 Donate Buy me a coffee \$2.00 USD Buy me a burger \$5.00 USD Buy me a pizza \$10.00 USD
 Compiler Used by me C-Free 5.0(Recommended) Other Compilers Code Blocks(Recommended) Online Compilers Ideone(Remember to give input before executing online where ever necessary)