Method sort

Programs/QuickSort.java:25–47

(int arr[],int i,int j,int pivot)

    }
    
    public static int[] sort(int arr[],int i,int j,int pivot){
        if(j<=pivot || i>=arr.length){
            return arr;
        }
        while(arr[i] < arr[pivot]){
            i++;
        }
        while(arr[j]> arr[pivot]){
            j--;
        }
        if(i<j){
            int tmp = arr[i];
            arr[i] = arr[j];
            arr[j] = tmp;
            return sort(arr,i,j,pivot);
        }
        else{
            int tmp = arr[pivot];
            arr[pivot] = arr[j];
            arr[j] = tmp;
            return arr;
        }
    }
}