Quicksort Algorithm

by victor wisdom

JavaScript

const nums = [6,5,2,9,1,3,11,4];

function qSort(arr){
    // if the number in the array is less than one then it should not sort
    if(arr.length <= 1){
        return arr
    } 
    // if it is more than one then perform the function below
    
    // Setting partition and pivot 
    let left = [], right = [], newArray =[], pivot = arr.pop(), length = arr.length
    
    for(let index = 0; index < length; index++){
        if(arr[index] <= pivot){
            left.push(arr[index])
        }
        else{
            right.push(arr[index])
        }
    }
    return newArray.concat(qSort(left), pivot, qSort(right));
    
}
console.log("original" , nums);
console.log("Sorted Array", qSort(nums));

//Click to run button at the top left of the page execute Quicksort function