三种简单排序实现

SHELK

已于 2023-09-21 22:46:47 修改

阅读量78

点赞数

文章标签：算法排序算法数据结构

于 2023-07-05 10:04:59 首次发布

本文链接：https://blog.csdn.net/weixin_50968698/article/details/131549575

版权

选择排序

        function selectSort(){
            for(var i=0; i<len; i++){
                for(var j=i+1; j<num.length; j++){
                    if(num[i] > num[j]){
                        temp = num[i];
                        num[i] = num[j];
                        num[j] = temp;
                    }
                }
            }
            return num;
        }

冒泡排序

        function bubbleSort(){
            for(var i=0; i<len; i++){
                for(var j=0; j<len-i; j++){
                    if(num[j]>num[j+1]){
                        temp = num[j];
                        num[j] = num[j+1];
                        num[j+1] = temp;
                    }
                }
            }
            return num;
        }

插入排序

        function insertSort(){
            for(var i=0; i<len; i++){
                for(var j=i+1; j>0; j--){
                    if(num[j-1]>num[j]){
                        temp = num[j-1];
                        num[j-1] = num[j];
                        num[j] = temp;
                    }
                }
            }
            return num;
        }

完整代码

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
    <script>
        var num = [5,6,9,4,0,66,44,85,11]
        var temp;
        var len = num.length

        function selectSort(){
            for(var i=0; i<len; i++){
                for(var j=i+1; j<num.length; j++){
                    if(num[i] > num[j]){
                        temp = num[i];
                        num[i] = num[j];
                        num[j] = temp;
                    }
                }
            }
            return num;
        }

        function bubbleSort(){
            for(var i=0; i<len; i++){
                for(var j=0; j<len-i; j++){
                    if(num[j]>num[j+1]){
                        temp = num[j];
                        num[j] = num[j+1];
                        num[j+1] = temp;
                    }
                }
            }
            return num;
        }

        function insertSort(){
            for(var i=0; i<len; i++){
                for(var j=i+1; j>0; j--){
                    if(num[j-1]>num[j]){
                        temp = num[j-1];
                        num[j-1] = num[j];
                        num[j] = temp;
                    }
                }
            }
            return num;
        }
    </script>
</head>
<body>
    <h3 id="selectSort">5,6,9,4,0,66,44,85,11</h3>
    <button onclick="document.getElementById('selectSort').innerHTML=selectSort() ">选择排序</button>
    <h3 id="bubbleSort">5,6,9,4,0,66,44,85,11</h3>
    <button onclick="document.getElementById('bubbleSort').innerHTML=bubbleSort()">冒泡排序</button>
    <h3 id="insertSort">5,6,9,4,0,66,44,85,11</h3>
    <button onclick="document.getElementById('insertSort').innerHTML=insertSort()">插入排序</button>
</body>
</html>

效果