quicksort.js

function quickSort(originalArray) {  
       if (originalArray.length <= 1) {    
             return originalArray;  
           } 
       else 
           {    
             let leftSide = [];   
             let rightSide = [];   
             let newArray = [];   
             let pivot = originalArray.pop();   
             let length = originalArray.length;    
             for (let i = 0; i < length; i++) {    
                  if (originalArray[i] <= pivot) {  
                       leftSide.push(originalArray[i]);    
                      } 
                  else 
                      {     
                        rightSide.push(originalArray[i]);    
                      }   
             }//END FOR   
              return newArray.concat(quickSort(leftSide), pivot, quickSort(rightSide));  
  } //END ELSE
}//END QUICKSORT