其實python也還行,就是沒有filter這個函數
def QuickSort(li=[]):
if len(li) <= 1:
return li
else:
return QuickSort([x for x in li if x < li[0]]) + \
[x for x in li if x == li[0]] + \
QuickSort([x for x in li if x > li[0]])
def QuickSort(li=[]):
if len(li) <= 1:
return li
else:
return QuickSort([x for x in li if x < li[0]]) + \
[x for x in li if x == li[0]] + \
QuickSort([x for x in li if x > li[0]])
2017-05-26