算法之快速排序(nodejs)

最新推荐文章于 2024-06-02 16:36:55 发布

原创最新推荐文章于 2024-06-02 16:36:55 发布 · 926 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#nodejs #快速排序 #算法

nodejs 专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一种快速排序算法的具体实现过程，包括关键的分区函数和递归调用的Sort函数。通过实例演示了如何对一个整数数组进行排序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

class QuickSort{



    swap(a,left,right){
        let tmp;
        tmp = a[left];
        a[left] = a[right];
        a[right] = tmp;
    }

    partition(a ,left ,right){
        let self = this;
        let pivotKey = a[left];
        let pivotPoint = left ;

        while (left <right){
            while(left<right&&a[right]>pivotKey){ //先从右边开始 当小于a[left] 就停止
                right--;
            }
            while(left<right&&a[left]<=pivotKey){ //右边停止后 ，左边开始， 当大于a[left] 就停止
                left++;  
            }
            self.swap(a,left,right) //把大的交换到右边，把小的交换到左边

            }

            self.swap(a,pivotPoint,left) //最后把piovt到中间
            console.log(a)
            return left

    }

    Sort(a,left,right){

        let self = this;
        if (left>=right){ //跳出递归

            return
        }

        const pivotPos = self.partition(a,left,right)

        self.Sort(a,left,pivotPos-1)
        self.Sort(a,pivotPos+1,right)


    }

}

module.exports = QuickSort;

const QuickSort = require("./quickSort");

let a =[34,5,25,7,54,23,56,75,32,344,53,2]
let left = 0;

let right = a.length-1;

const quick = new QuickSort();

quick.Sort(a,left,right)

result

➜  quickSort node test.js
[ 32, 5, 25, 7, 2, 23, 34, 75, 56, 344, 53, 54 ]
[ 23, 5, 25, 7, 2, 32, 34, 75, 56, 344, 53, 54 ]
[ 7, 5, 2, 23, 25, 32, 34, 75, 56, 344, 53, 54 ]
[ 2, 5, 7, 23, 25, 32, 34, 75, 56, 344, 53, 54 ]
[ 2, 5, 7, 23, 25, 32, 34, 75, 56, 344, 53, 54 ]
[ 2, 5, 7, 23, 25, 32, 34, 53, 56, 54, 75, 344 ]
[ 2, 5, 7, 23, 25, 32, 34, 53, 56, 54, 75, 344 ]
[ 2, 5, 7, 23, 25, 32, 34, 53, 54, 56, 75, 344 ]