Friday 15 April 2016

Quick sort c++ implementation

#include<iostream>
using namespace std;
class sorting
{
int a[10],n;
public:
sorting()
{
cout<<"Number of Element:-";
cin>>n;
cout<<"Unsorted Element:-";
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
int p=1;
int r=n;
quick(p,r);
}
int operation(int p,int r)
{
int x=a[r];
int i=p-1;
for(int j=p;j<r;j++)
{
if(a[j]<=x)
{
i++;
int t=a[i];
a[i]=a[j];
a[j]=t;
}
}
int t1=a[i+1];
a[i+1]=a[r];
a[r]=t1;
return i+1;
}
void quick(int p,int r)
{
if(p<r)
{
int q=operation(p,r);
quick(p,q-1);
quick(q+1,r);
}
}
void disp()
{
cout<<"Sorted Element:-";
for(int i=1;i<=n;i++)
{
cout<<a[i]<<endl;
}
}
};
int main()
{
sorting x;
x.disp();
}

No comments:

Post a Comment