Python快速排序算法优化

快速排序算法在开发实践中，应用广泛。
这里把边界代码分享一下。
Python 3.8.1 (tags/v3.8.1:1b293b6, Dec 18 2019, 22:39:24) [MSC v.1916 32 bit (Intel)] on win32
Type “help”, “copyright”, “credits” or “license()” for more information.

def quickSort (alist):
quickSortHelper(alist,M，len(alist)-1)

 def quickSortHelper(alist ,first,last):
if first <last:
    #边界条件
	splitpoint=  partition(alist,first,last)
	quickSortHelper(alist,first,splitpoint-1)
	quickSortHelper(alist,splitpoint+1,last)

alist= [52,26,93,17,77,31,43,55,20]
#列表删选

quickSort(alist)
#类FFT算法