1. const array = [0, 3, 6, 17, 35, 100, 98, 66, 88, 58, 23, 45, 45, 34, 11];
    3. function quickSort(array) {
    4.   if (array.length <= 1) {
    5.     return array;
    6.   }
    7.   const midIndex = Math.floor(array.length / 2);
    8.   const mid = array.splice(midIndex, 1)[0];
    9.   const left = [];
    10.   const right = [];
    11.   for (let i = 0; i < array.length; i++) {
    12.     if (array[i] < mid) {
    13.       left.push(array[i]);
    14.     } else {
    15.       right.push(array[i]);
    16.     }
    17.   }
    18.   return quickSort(left).concat([mid], quickSort(right));
    19. }
    21. function binarySearch(array, search, pos = 0) {
    22.   if (!Array.isArray(array)) throw new Error(`params type error`);
    23.   const len = array.length;
    24.   const midIndex = Math.floor((len - 1) / 2);
    25.   if (array[midIndex] === search) {
    26.     console.log(`${search} is at ${pos + midIndex}`);
    27.   } else if (array[midIndex] < search) {
    28.     return binarySearch(array.slice(midIndex + 1), search, pos + midIndex + 1);
    29.   } else if (array[midIndex] > search) {
    30.     return binarySearch(array.slice(0, midIndex), search, pos);
    31.   } else {
    32.     console.log(`no found ${search}`);
    33.   }
    34. }
    36. const sortArray = quickSort(array);
    37. binarySearch(sortArray, 51);
    38. binarySearch(sortArray, 66);