zoukankan      html  css  js  c++  java
  • 排序算法

    冒泡

    function bubbleSort(arr) {
        var len = arr.length
        for (var i = 0; i < len; i++) {
            for (var j = 0; j < len - 1 - i; j++) {
                if (arr[j] > arr[j + 1]) {
                    var temp = arr[j + 1]
                    arr[j + 1] = arr[j]
                    arr[j] = temp
                }
            }
        }
        return arr
    }
    var arr = [3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
    console.log(bubbleSort(arr))

    快排

    function quickSort(arr) {
        if (arr.length < 1) {
            return arr
        }
        var midIndex = Math.floor(arr.length / 2)
        var mid = arr.splice(midIndex, 1)[0]
        var left = [], right = []
        for (var i = 0; i < arr.length; i++) {
            if (arr[i] < mid) {
                left.push(arr[i])
            } else {
                right.push(arr[i])
            }
        }
        return quickSort(left).concat([mid], quickSort(right))
    }
    
    var arr = [2, 1, 5, 8, 3, 7, 4, 6, 9];
    console.log(quickSort(arr)); //[1, 2, 3, 4, 5, 6, 7, 8, 9]
  • 相关阅读:
    绿豆加速器
    电脑派位系统(新生入学摇号) v2016
    硬盘安装win10
    msbuild
    async
    win sshd
    Ftp软件
    nginx basic auth 登陆验证模块
    深入理解docker的link机制
    Docker Compose to CoreOS
  • 原文地址:https://www.cnblogs.com/lianglanlan/p/14453645.html
Copyright © 2011-2022 走看看