Quick Sort

Advertisements

Prev Tutorial Next Tutorial

Quick Sort in C

Quick Sort, as the name indicate, sorts any list of data very quickly. Quick sort very fast data sorting technique and it requires very less additional space. It is based on the rule of Divide and Conquer(also called partition-exchange sort).

Quick sort algorithm contain mainly three parts;

  • Elements less than the Pivot element
  • Pivot element
  • Elements greater than the pivot element

Example of quick sort

quick sort

Example of quick sort

	
#include<stdio.h>
#include<conio.h>

void quicksort(int [],int,int);
int partition(int [],int,int);

main()
{
int a[20],p,q,i,n;
clrscr();

printf("How many elements you want to enter: ");
scanf("%d",&n);
for(i=0; i<n; i++)
{
printf("\nEnter any %d elements: "n);
scanf("%d",&a[i]);
}

p=0;
q=n-1;
printf("\n\n\nArray Befor Sorting : ");
for(i=0; i<n; i++)
{
delay(500);
printf("%5d",a[i]);
}
quicksort(a,p,q);

printf("\n\n\nArray After Sorting : ");
for(i=0; i<n; i++)
{
delay(500);
printf("%5d",a[i]);
}
getch();
return 0;
}


void quicksort(int a[],int p,int q)
{
int j;
if(p<q)
{
j=partition(a,p,q+1);
quicksort(a,p,j-1);
quicksort(a,j+1,q);
}
}

int partition(int a[],int m,int p)
{
int v,i,j;
int temp;
v=a[m];
i=m;j=p;
do
{
do
{
i += 1;
}
while(a[i]<v);
do
{
j -= 1;
}
while(a[j]>v);

if(i<j)
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
while(i<j);
a[m] =a[j];
a[j] = v;
return j;
}
merge sort example
Prev Tutorial Next Tutorial

Advertisements

Buy This Ad Space @$20 per Month, Ad Size 600X200 Contact on: hitesh.xc@gmail.com or 9999595223

Pure VPN Privide Lowest Price VPN Just @ $1.65. Per Month with Non Detected IP Lowest Price Non Detected IP VPN

Magenet is best Adsense Alternative here we earn $2 for single link, Here we get links ads. Magenet

Download Projects

Google Advertisements


Buy Websites 9999595223

Buy College Projects with Documentation Contact on whatsapp 9999595223. Contact on: hitesh.xc@gmail.com or 9999595223 Try this Keyword C++ Programs

Advertisements