import java.util.Arrays;


public class Quicksort {

    /**
     * @param args
     */
    // use int or inline
    static void swap(int[] arr, int i, int j){
        int temp=arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }
    static void quicksort(int[] arr, int left, int right){
        if(right-left > 0){
            int p = partition(arr, left, right);
            quicksort(arr,left,p-1);
            quicksort(arr, p+1, right);
        }
    }
    static int partition(int[] arr, int left, int right){
        int pivot = right;
        int higherthanpivot=left;
        for(int i=left; i<right;i++){
            if(arr[i] < arr[pivot]){
                swap(arr, i, higherthanpivot);
                higherthanpivot++;
            }
        }
        swap(arr,pivot,higherthanpivot);
        return higherthanpivot;
    }
    public static void main(String[] args) {
        int[] a= new int[]{2,2,2,3,54,1,12,3453,453,1,1,2,2,3,8,02,1,23};
        quicksort(a,0,a.length-1);
        System.out.println(Arrays.toString(a));


    }

}