花果山

def binarysearch(A,x): low=0 high=len(A)-1 j=0 i=0 while low<=high and j==0: mid=(low+high)/2 if x==A[mid]: j=mid elif x<A[mid]:

def merge(A,p,q,r): s=p t=q+1 k=p #s,t are the subarray index,k is B[] index B=[] while s<=q and t<=r: if A[s]<=A[t]: B.append(A[s]) s=s+1

def selectionsort(A): for i in range(len(A)): #print i,# k=i #print A[i+1:len(A)],# for j in range(i+1,len(A)): if A[j]<A[k]: k=j if k!=i: t=A[i] A[i]=A[k] A[

def prim(G): dis=0 x=[1] select=G[0] #edge can be selected next time for i in range(len(G)-1): #add n-1 edge for key in select.keys(): #select