摘要：
def partition(A, p, r): j = p+1 for i in range(p+1, r+1): if(A[i] < A[p]): tmp = A[i] A[i] = A[j] A[j] =... 阅读全文
posted @ 2014-08-31 18:01
ruccsbingo
阅读(215)
评论(0)
推荐(0)
摘要：
tmp = []def bucket_sort(old): for i in range(len(old)): tmp.append([]) for i in old: tmp[int( i * len(old) )].append(i) ... 阅读全文
posted @ 2014-08-31 16:18
ruccsbingo
阅读(342)
评论(0)
推荐(0)
摘要：
def insert_sort(old): for i in range(1, len(old)): for j in range(i, 0, -1): if(old[j] < old[j-1]): tmp = old[j] ... 阅读全文
posted @ 2014-08-31 15:48
ruccsbingo
阅读(112)
评论(0)
推荐(0)
摘要：
old = [2, 5, 3, 0, 2, 3, 0, 3]new = [0, 0, 0, 0, 0, 0]for i in range(len(old)): new[old[i]] = new[old[i]] + 1for i in range(len(new)): for j in ... 阅读全文
posted @ 2014-08-31 10:39
ruccsbingo
阅读(172)
评论(0)
推荐(0)
浙公网安备 33010602011771号