Quick Sort

Posted: 9 June 2008 in Puisi
Tags: ,

#include <iostream.h>
#include <conio.h>

void main()
{
void srt(int[],int,int);
int a[10],count=0,n;
clrscr();
cout<<“Ener 10 values in unsorted order : \n”;
for (n=0;n<10;n++)
{
cout<<“value no.: “<<(n+1)<>a[n];
count++;
}
n=0;
clrscr();
srt(a,n,count-1);
clrscr();
cout<<“\t\tThe Sorted order is : \n”;
for (n=0;n<10;n++)
{
cout<<“\t\tposition : “<<(n+1)<<“\t”<<a[n]<<“\n”;
}
getch();
}
void srt(int k[20],int lb,int ub)
{
int i,j,key,flag=0,temp;
clrscr();
if (lb<ub)
{
i=lb;
j=ub+1;
key=k[i];
while(flag!=1)
{
i++;
while(k[i]key)
{
j–;
}
if (i<j)
{
temp=k[i];
k[i]=k[j];
k[j]=temp;
}
else
{
flag=1;
temp=k[lb];
k[lb]=k[j];
k[j]=temp;
}
}
srt(k,lb,j-1);
srt(k,j+1,ub);
}
}

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s