摘要：1 # -*- coding: utf-8 -*- 2 import math 3 4 def merge(l1, l2): 5 list_merge = [] 6 i = j = 0 7 while i list2[l2_m]: 37 return problem_9_3_8(list1, list2, l1, l1_m, l2... 阅读全文

摘要：QUICK-SORT-8-4(C,key,l,r) j = l-1 for i = l to r if COMPARE(C[i],key) =< 0 j = j+1 swap(C[i], C[j]) if COMPARE(C[i],key) == 0 k = j swap(C[j], C[k]) return j SORT-PROBLEM-8-4(A,B,l... 阅读全文

摘要：1 阅读全文

摘要：SORT_PROBLEM_A(A, n) let B[1..n] be a new array for i = 1 to n make B[i] an empty list for i = 1 to A.length j = 1 while A[i]/10 j = j + 1 insert A[i] into list B[j] for i = 1 to n /... 阅读全文

摘要：1 COUNTING-SORT2(A,k) 2 let C[0..k] be a new array 3 for i = 0 to k 4 C[i]=0 5 for i = 1 to A.length 6 C[A[i]] = C[A[i]]+1 7 for i = 1 to k 8 ... 阅读全文

摘要：快速排序，尾递归。最坏情况下栈深度Θ(lgn) 阅读全文