堆排序实现********1424344function stacksort(arr){ //上浮 function swim(arr, p){ while (p > 1 && arr[p] > arr[parseint(p / 2)]){ [arr[p], arr[parseint(p / 2)]] = [arr[parseint(p / 2)], arr[p]] p = parseint(p / 2) } } //下沉--将第一个元素下沉 function sink(arr, i, len){ while (2 * i <= len){ let j = 2 * i if (j < len && arr[j] < arr[j + 1]) j++ if (arr[i] < arr[j]){ [arr[i], arr[j]] = [arr[j], arr[i]] i = j } else { break } } } let length = arr.length for (let i = length - 1; i >= 0; i--){ arr[i + 1] = arr[i] } for (let i = 0; i < length; i++){ swim(arr, i + 1) } for (let i = length; i > 1; i--){ [arr[1], arr[i]] = [arr[i], arr[1]] sink(arr, 1