Untitled

let arr = [5,6,32,7,43,1,7, -1]
function partition(arr,low, high){
    let pivot = arr[high]
    let i = low-1
    for(let j=low;j<high;j++){
        if(arr[j]<pivot){
            i++;
            [arr[i], arr[j]]=[arr[j], arr[i]]
        }}
    [arr[i+1], arr[high]]=[arr[high], arr[i+1]]
    return i+1
}
function QuickSort(arr,low, high){
    if (low < high) { 
    let pi = partition(arr, low, high)
    QuickSort(arr, low, pi-1)
    QuickSort(arr, pi+1, high)
    }}
QuickSort(arr, 0, arr.length-1)
console.log(arr)