#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)<<"\t"; cin>>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) { i++; } j--; while(k[j]>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); } }
Sunday, 7 June 2015
Code for Program to perform quick sort in C++ Programming
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment