Python实现10大排序算法.rar

''' 快速排序 时间复杂度：O(nlogn)~O(n^2), O(nlogn) 空间复杂度：O(logn) 稳定性：不稳定 ''' def quickSort(alist): if len(alist) < 2: return alist mid = alist[len(alist) // 2] left, right = [], [] alist.remove(mid) for item in alist: if item < mid: left.append(item) else: right.append(item) return quickSort(left) + [mid] + quickSort(right) # def quick_sort(alist): # quickSortHelper(alist, 0, len(alist)-1) # def quickSortHelper(alist, first, last): # if first >= last: # return # pivotValue = alist[first] # left = first + 1 # right = last # while left <= right: # while left <= right and alist[left] <= pivotValue: # left += 1 # while left <= right and alist[right] >= pivotValue: # right -= 1 # if left < right: # alist[left], alist[right] = alist[right], alist[left] # alist[first], alist[right] = alist[right], alist[first] # quickSortHelper(alist, first, right-1) # quickSortHelper(alist, right+1, last) if __name__ == '__main__': arr = [4, 5, 8, 2, 3, 6, 7, 1] # quick_sort(arr) # print(arr) print(quickSort(arr))