js实现希尔排序

function shellSort(arr) {
const len = arr.length;
let gap = Math.floor(len / 2);

while (gap > 0) {
for (let i = gap; i < len; i++) {
let temp = arr[i];
let j = i;

  while (j >= gap && arr[j - gap] > temp) {
    arr[j] = arr[j - gap];
    j -= gap;
  }

  arr[j] = temp;
}

gap = Math.floor(gap / 2);

}

return arr;
}

// 示例用法
const arr = [64, 25, 12, 22, 11];
console.log(shellSort(arr));