Quicksort.java

public  class Quicksort {
    //for partition of array
    public static int partition(int arrs[], int low, int high) {
        int pivot = arrs[high];
        int i = low-1;
        for(int j = low; j < high; j++){
            if (arrs[j] < pivot) {
                i++;
                int temp = arrs[i];
                arrs[i] = arrs[j];
                arrs[j] = temp;
            }
            int temp = arrs[i+1];
                arrs[i+1] = arrs[high];
                arrs[high] = temp;
        }
        return i+1; 
    }

 //function
    public static void quicksort(int arrs[], int low, int high) {
        if (low < high) {
            
        
        int pi =  partition(arrs, low, high);;

        quicksort(arrs , low, pi-1);
        quicksort(arrs , pi+1, high);
        }
    }
    
    public static void main(String[] args) {

        // create an array
        int nums[] = {23,4,45,86,4,24,23,13};

        //call the function
        quicksort(nums, 0, nums.length-1);
        for(int num:nums){
            System.out.print(num+" ");
        }

        
    }
}