【python】python数据结构（七）——排序：快速排序

算法说明

时间复杂度：O(nlogn)

不稳定

代码

#coding=utf-8def quick_sort(array, left, right):    if left < right:        mid = partition(array, left, right)        quick_sort(array, left,  mid-1)        quick_sort(array, mid+1, right)    return arraydef partition(array, left, right):    tmp = array[left]    while left < right:        while left < right and array[right] >= tmp:            right -= 1        array[left] = array[right]        while left < right and array[left] <= tmp:            left += 1        array[right] = array[left]    array[left] = tmp    return leftlst = input().split(',')print(quick_sort(lst,0,len(lst)-1))