最大堆排序输出（max heap sort)

最新推荐文章于 2022-08-08 15:57:26 发布

lifeqiuzhi521

最新推荐文章于 2022-08-08 15:57:26 发布

阅读量932

点赞数

分类专栏：算法文章标签： javascript 堆排序 heap html

本文链接：https://blog.csdn.net/lifeqiuzhi521/article/details/77507476

版权

算法专栏收录该内容

82 篇文章 0 订阅

订阅专栏

实现通过javascript来写最大堆排序
<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <title>Title</title>
</head>
<body>
<script>
    var heapArray = [1,2,3,4,5,6,7,8,9];//这里构建的是最大堆
    function buildMaxHeap(heapArray, allIndex) {
        var lastIndex = Math.floor(heapArray.length / 2) - 1 + allIndex;
        for (var index = lastIndex; index >= allIndex; index--) {
            var lastLeftIndex = index * 2 + 1;
            if (lastLeftIndex >= heapArray.length) {
                continue;
            }
            var lastLeftData = heapArray[lastLeftIndex];
            if (heapArray[index] <= lastLeftData) {
                heapArray[lastLeftIndex] = heapArray[index];
                heapArray[index] = lastLeftData;
                buildMaxHeap(heapArray, lastLeftIndex);
            }
            var rightLastIndex = lastLeftIndex + 1;
            if (rightLastIndex >= heapArray.length) {
                continue;
            }
            if (heapArray[rightLastIndex] >= heapArray[index]) {
                var temp = heapArray[index];
                heapArray[index] = heapArray[rightLastIndex];
                heapArray[rightLastIndex] = temp;
                buildMaxHeap(heapArray, rightLastIndex);
            }
        }
    }

    function sortByHeap(heapArray){
        var temp = heapArray.length;
        var data = '';
        for (var i = 0; i < temp; i++) {
            buildMaxHeap(heapArray, 0);
            data += heapArray.shift()+',';
        }
        console.log('wori yo test', data);
    }
    sortByHeap(heapArray);
</script>
</body>
</html>

lifeqiuzhi521

关注

0
点赞
踩
1

收藏

觉得还不错? 一键收藏
0
评论
最大堆排序输出（max heap sort)

实现通过javascript来写最大堆排序html>html lang="en">head> meta charset="UTF-8"> title>Titletitle>head>body>script> var heapArray = [1,2,3,4,5,6,7,8,9];//这里构建的是最大堆 function buildMaxHeap(hea
复制链接

扫一扫