int partion(int a[],int low,int high)
{
int key=a[low];
while(low
while (low
if(low
a[low]=a[high];
a[high]=key;
}
while (low
low++;
if(low
a[low]=key;
}
}
return low;
}
void quick_sort(int a[],int low,int high)
{
if(low
int mid=partion(a,low,high);
quick_sort(a,0,mid-1);
quick_sort(a,mid+1,high);
}
}