首页代码生成（python快速排序）

代码生成（python快速排序）

时间: 2023-06-14 20:07:14 浏览: 77

快速排序 python实现代码

function quick_sort(s, _begin, _end) if _begin < _end then i = _begin j = _end pivot = s[j] while i < j do while(i < j and s[i] <= pivot) do i = i + 1 end if i < j then s[j] = s[i] end while(i < j and s[j] >= pivot) do j = j - 1 end if i < j then s[i] = s[j] end end s[j] = pivot; quick_sort(s, _begin, i - 1) quick_sort(s, i + 1, _end) end end function prints (s) local tmp = '' for i = 1,#a do tmp = tmp..a[i].." " end print(tmp) end a = {11,5,25,8,2,95,10,7} quick_sort(a,1,#a) prints(a)

以下是Python中快速排序的实现代码： def quick_sort(arr): if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quick_sort(left) + middle + quick_sort(right)

阅读全文