JavaScript排序与搜索算法详解

function bubbleSort(arr) {
  const len = arr.length;
  for (let i = 0; i  arr[j + 1]) {
        [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];
      }
    }
  }
  return arr;
}

function selectionSort(arr) {
  const len = arr.length;
  for (let i = 0; i 

function insertionSort(arr) {
  for (let i = 1; i = 0 && arr[j] > current) {
      arr[j + 1] = arr[j];
      j--;
    }
    arr[j + 1] = current;
  }
  return arr;
}

function quickSort(arr) {
  if (arr.length  x  x === pivot);
  const right = arr.filter(x => x > pivot);
  return [...quickSort(left), ...middle, ...quickSort(right)];
}

function mergeSort(arr) {
  if (arr.length const mid = Math.floor(arr.length / 2);
const left = mergeSort(arr.slice(0, mid));
const right = mergeSort(arr.slice(mid));
return merge(left, right);
}
function merge(left, right) {
let result = [];
let i = 0, j = 0;
while (i < left.length && j < right.length) {
if (left[i] < right[j]) {
result.push(left[i++]);
} else {
result.push(right[j++]);
}
}
return result.concat(left.slice(i)).concat(right.slice(j));
}

function linearSearch(arr, target) {
  for (let i = 0; i 

function binarySearch(arr, target) {
  let left = 0;
  let right = arr.length - 1;
  while (left