quick_so.cpp

quicccck sort using divide n conquer...

#include<iostream.h>
#include<conio.h>
int data[100];
int q=0;
int o;
void quicksort(int data[],int start,int end);
void main()
{
clrscr();
cout<<"\nenter no:";
cin>>o;
cout<<"\n enter ele 1 by 1:\n";
for(int j=0;j<o;j++)
cin>>data[j];
quicksort(data,0,o-1);
//for(int i=0;i<o;i++)
//cout<<"\t"<<data[i];
getch();
}
void quicksort(int data[],int start,int end)
{
int elt,low,high;
low=start;
high=end;
elt=data[start];
cout<<"   low="<<low<<"   high="<<high<<"   pivot="<<elt;
cout<<"\n";
while(start<end)
{
while((data[end]>=elt)&&(start<end))
end--;
if(start!=end)
{
data[start]=data[end];
start++;
}
while((data[start]<=elt)&&(start<end))
start++;
if(start!=end)
{
data[end]=data[start];
end--;
}
}
data[start]=elt;
elt=start;
start=low;
end=high;
if(start<elt)
{
cout<<"\n sorted elements during"<<q++<<" pass\n";
for(int t=0;t<o;t++)
cout<<"\t"<<data[t];
cout<<"\n";
quicksort(data,start,elt-1);
}
if(end>elt)
{cout<<"\n breakup occured at "<<data[elt];
cout<<"\n";
for(int t=0;t<o;t++)
cout<<"\t"<<data[t];
cout<<"\n";
quicksort(data,elt+1,end);
}
}