python实现排序算法
2016-08-11 本文已影响0人
邱坨坨
import random
def BubbleSort(num):
n=len(num)
for i in range(0,n):
for j in range(i,n):
if num[i]>=num[j]:
num[i],num[j]=num[j],num[i]
return num
import random
def BubbleSort(num):
n=len(num)
for i in range(0,n):
for j in range(i,n):
if num[i]>=num[j]:
num[i],num[j]=num[j],num[i]
return num