选择,冒泡,合并 via Python
前两天刚装了python 3.1.1, 禁不住技痒写点code。1.选择排序
<!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />-->>>>defSelSort(L):
length=len(L)
foriinrange(length-1):
minIdx=i
minVal=L
j=i+1
whilej<length:
ifminVal>L:
minIdx=j
minVal=L
j=j+1
L,L=L,L
returnL
2.冒泡排序 <!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />-->>>>defbubSort(L):
swapped=True
whileswapped:
swapped=False
foriinrange(len(L)-1):
ifL>L+1]:
L,L+1]=L+1],L
swapped=True
returnL
3.合并排序<!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />-->>>>defmerge(left,right):
result=[]
i,j=0,0
whilei<len(left)andj<len(right):
ifleft<=right:
result.append(left)
i=i+1
else:
result.append(right)
j=j+1
result+=left
result+=right
returnresult
>>>defmergesort(L):
iflen(L)<2:
returnL
else:
middle=int(len(L)/2)
left=mergesort(L[:middle])
right=mergesort(L)
returnmerge(left,right)
python用得不熟, 欢迎围观排砖~
页:
[1]