Quick  Sort using Templates


#include<iostream.h>
#include<string.h>
#include<conio.h>
template<class T>
void quick(T *n,int low,int high)
{
int pos;
if(low<high)
{
pos=split(n,low,high);
quick(n,low,pos-1);
quick(n,pos+1,high);
}
}
template<class T>
int split(T *n,int low,int high)
{
int pos,left,right;
T item,t;
item=n[low];
left=low;
right=high;
while(left<right)
{
while(n[right]>item)
right=right-1;
while((left<right)&&(n[left]<=item))
left=left+1;
if(left<right)
{
t=n[left];
n[left]=n[right];
n[right]=t;
}
}
pos=right;
t=n[low];
n[low]=n[pos];
n[pos]=t;
return pos;
}
void main()
{
int arr[]={-12,23,14,0,245,78,66,-9};
int i;
clrscr();
cout<<endl<<endl;
quick(arr,0,7);
cout<<"Sorted array value:"<<endl;
for(i=0;i<=7;i++)
cout<<arr[i]<<endl;
getch();
}