hjuj_91的专栏

等啥会学会了再分析。。       - -

int choosePivot(int a[],int len){ int temp; temp = a[len - 1]; a[len - 1] = a[0]; a[0] = temp; return 0; }void quickSort(int a[],int len){ int pivot = 0; int i = 1,j,temp; int flag =

- -

def shellTest(l): h = 1 while h = 1: for i in range(h,len(l)): while i - h >= 0 and l[i] < l[i - h]: temp = l[i] l[i] = l[i - h] l[i - h] = temp i -= h h /= 3 return l

def exch(l,i,j): temp = l[i] l[i] = l[j] l[j] = tempdef sort(l): quick(l,0,len(l) - 1)def quick(l,lo,hi): if lo >= hi: return v = l[0] i = lo gt = hi lt = lo

public class Sort { private static void sink(int[] a,int k,int N) { while (2 * k <= N) { int j = 2 * k; if (j < N && less(a,j,j+1)) j++; if (!less(a,k,j)) break; exch(a,k,j); k

def memoize(f): def memf(*x): if x not in memf.cache: memf.cache[x] = f(*x) return memf.cache[x] memf.cache = {} return memfclass Graph: def __init__(self,

def count(array): def merge(l,r): if len(l) == 0 or len(r) == 0: return (l+r,0) #print l,r n = 0 res = [] j,k = 0,0 lengthl = len(l)