摘要:
def bubbleSort(L): for j in range(len(L)): print L print j for i in range(len(L)-1): if L[i]>L[i+1]: temp=L[i+1] L[i+1]=L[i] L[i]=temp厉害点的冒泡排序def bubbleSort(L): sort=True while sort: print L sort=Fals... 阅读全文
posted @ 2011-12-12 23:37
wyixin
阅读(429)
评论(3)
推荐(0)

浙公网安备 33010602011771号