数据结构-快排

最新推荐文章于 2024-08-25 17:42:15 发布

qq_41970241

最新推荐文章于 2024-08-25 17:42:15 发布

阅读量191

点赞数

本文链接：https://blog.csdn.net/qq_41970241/article/details/105521948

版权

1、快排朴素版

def parttion(nums,left,right):
            low=left
            high=right
            base=nums[low]
            while low<high:
                while low<high and nums[high]>=base:
                    high-=1
                if low<high:
                    nums[low]=nums[high]
                while low<high and nums[low]<=base:
                    low+=1
                if low<high:
                    nums[high]=nums[low]
                nums[low]=base
            return low
            
        def quicksort(nums,left,right):
            if left<right:
                index=parttion(nums,left,right)
                quicksort(nums,left,index-1)
                quicksort(nums,index+1,right)