def findmostsmall(arr):
smallest=arr[0]
sigh=0
for i in range(1,len(arr)):
if (smallest>arr[i]):
smallest=arr[i]
sigh=i
return sigh
def sort(arr):
arr_new=[]
for i in range(len(arr)):
smallest=findmostsmall(arr)
arr_new.append(arr.pop(smallest))
print arr
return arr_new
print sort([5,3,2,6])
smallest=arr[0]
sigh=0
for i in range(1,len(arr)):
if (smallest>arr[i]):
smallest=arr[i]
sigh=i
return sigh
def sort(arr):
arr_new=[]
for i in range(len(arr)):
smallest=findmostsmall(arr)
arr_new.append(arr.pop(smallest))
print arr
return arr_new
print sort([5,3,2,6])
扫一扫
218
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
