![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Python
cheap talk show code
清淡的程序猿一枚 思想盗墓者....
展开
-
python3 -- 快速排序
#coding:utf-8 def qsort(L): if len(L) <= 1: return L return qsort([lt for lt in L[1:] if lt < L[0]]) + L[0:1]+ \ qsort([ge for ge in L[1:] if ge >= L[0]]) iList = [3,14,2,12,9,3...转载 2019-04-11 23:10:38 · 232 阅读 · 0 评论 -
python3 -- 快速排序2
import numpy as np def quick_sort(array, left, right): if left >= right: return low = left high = right key = array[low] while left < right: while left <...转载 2019-04-11 23:11:34 · 135 阅读 · 0 评论