/*eduLanka Online education web site of Sri Lanka -------- w w w . e d u L a n k a . c o m ------------ java programs for University students - who follow courses - BIT - SLIIT and more find more lessons in http://www.it.edulanka.com eduLanka@gmail.com this programs under GNU licence */ import TerminalIO.*; class QuickSort{ public static void main(String []args){ KeyboardReader input=new KeyboardReader(); int n=input.readInt("enter list size : "); int[] Arr=new int[n]; for(int i=0;i<n;i++) Arr[i]=input.readInt("enter elements :"); int pivot1; pivot1=partition(Arr,0, n-1); System.out.println("Pivot Value is "+pivot1); quicksort(Arr, 0, n-1); for(int j=0; j<Arr.length ; j++) System.out.println(Arr[j]); } public static void quicksort(int array[], int left,int right) { int pivot =partition(array, left, right); if (left<pivot) quicksort(array, left, pivot-1); if (right>pivot) quicksort(array, pivot+1, right); } public static int partition(int numbers[],int left,int right){ int I_hold,r_hold,i; int pivot; I_hold=left; r_hold=right; pivot=numbers[left]; while(left<right){ while((numbers[right]>=pivot)&&(left<right)) right--; if(left!=right){ numbers[left]=numbers[right]; left++; } while((numbers[left]<=pivot)&&(left<right)) left++; if(left!=right){ numbers[right]=numbers[left]; right--; } } numbers[left]=pivot; pivot=left; left=I_hold; right=r_hold; return pivot; } }