package Demo;
public class QuickSort {
public static int getMiddle(int begin, int end, int arg[])
{
int temp = arg[begin];
while(begin<end)
{
while(begin<end && temp<=arg[end])
end-- ;
arg[begin] = arg[end];
while(begin<end && arg[begin]<=temp)
begin++;
arg[end] = arg[begin];
}
arg[end] = temp;
return end;
}
public static void sort(int begin, int end, int arg[])
{
if(begin<end)
{
int middle= getMiddle(begin,end,arg);
sort(begin,middle-1,arg);
sort(middle+1,end,arg);
}
}
public static void main(String args[])
{
int arg[] = {12,1,2,232,2,3,222,43,5,34,5,435,43,5};
if(arg.length>0)
{
sort(0,arg.length-1,arg);
}
for(int i :arg)
System.out.print(i+" ");
}
}