algorithms

function quickSort(nums) {

      if (nums.length <= 1) return nums;

      const pivot = nums[nums.length - 1];
      const left = [];
      const right = [];

      for (let i = 0; i < nums.length - 1; i++) {
        if (nums[i] < pivot) {
          left.push(nums[i]);
        } else {
          right.push(nums[i]);
        }
      }

      return [...quickSort(left), pivot, ...quickSort(right)];
}


const binarySearch = (id, array) => {
    let min = 0
    let max = array.length - 1
    let index 
    let element 

    while(min <= max){
        index = Math.floor((min + max) / 2)
        element = array[index]

        if(element.id < id){
            min = index + 1
        }else if(element.id > id){
            max = index - 1
        }else{
            return element
        }
    }
    return void 0
}