—Python算法

python算法实践7-归并排序

defMergeSort(mylist,low,mid,high):i=lowj=mid+1tmp=[]whilei<=midandj<=high:ifmylist[i]<=mylist[j]:tmp.append(mylist[i])i=i+1else:tmp.append(mylist[j])j=j+1whilei<=mid:tmp.append(mylist[i])i=i+1whilej<=
chollima·2010-03-16 17:00

python算法实践6-堆排序

#堆排序defHeapify(mylist,start,end):left=0right=0maxv=0left=start*2right=start*2+1whileleft=0:Heapify(mylist,i,size-1)i=i-1defHeapSort(mylist):BuildHeap(mylist)i=len(mylist)-1whilei>=0:tmp=mylist[0]mylis
chollima·2010-03-16 16:00

python算法实践5-直接选择排序

#直接选择排序defSelectSort(mylist):size=len(mylist)i=0foriinrange(0,size):k=iforjinrange(i+1,size):ifmylist[j]
chollima·2010-03-16 15:00

python算法实践4-快速排序

#快速排序defPartition(mylist,low,high):tmp=mylist[low]whilelow=tmp:high=high-1iflow
chollima·2010-03-16 15:00

python算法实践3-冒泡排序

#冒泡排序defBubbleSort(mylist):n=len(mylist)i=0j=0bExchange=Falseforiinrange(1,n):bExchange=Falsej=n-1whilej>=i:ifmylist[j]
chollima·2010-03-16 14:00

python算法实践2-shell排序

#shell排序defShellPass(mylist,d):size=len(mylist)i=dwhilei=0andmylist[j]>tmp:mylist[j+d]=mylist[j]j=j-dmylist[j+d]=tmpi=i+ddefShellSort(mylist):n=len(mylist)whilen>1:n=n//3+1ShellPass(mylist,n)mylist0=[
chollima·2010-03-16 11:00
上一页 15 16 17 18 19 20 21 22 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他