Python快速排序

代码如下，快排采用分治的思想

def quick(arr,f,l):    if f >= l:        return    else:        i = f - 1        for j in range(f,l):            if arr[j] <= arr[l]:                i += 1                arr[i], arr[j] = arr[j],arr[i]        arr[i+1] , arr[l] = arr[l],arr[i+1]        quick(arr,f,i)        quick(arr,i+1,l)arr=[0,8,6,5,8,9,4,7]quick(arr,0,7)print(arr)