main.java
//in this version of the quick sort we set the pivot as the highest index
in this version of the quick sort we set the pivot as the highest index
in this version of the quick sort we set the pivot as the highest index
public static int[] quick_sort(int[] arr, int low, int high){
        if(low < high)
        {
            int index = split(arr, low, high);
            quick_sort(arr, low, index-1);
            quick_sort(arr, index+1, high);
        }
        return arr;
    }
public static int [ ] quick_sort ( int [ ] arr , int low , int high ) { if ( low < high ) { int index = split ( arr , low , high ) ; quick_sort ( arr , low , index - 1 ) ; quick_sort ( arr , index + 1 , high ) ; } return arr ; }
in this version of the quick sort we set the pivot as the highest index
in this version of the quick sort we set the pivot as the highest index
//this if statement checks if the lower index is less than the higher it not it is considered a base case and ends a branch of recursion // the function is called to find a pivot and rearrange the array // recursively sort the list bellow the pivot and above the pivot including the pivot