Quick Sort

#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; [...]