# 插入排序 for i in range(0,len(arr)-1): temp = arr[i+1] j = i while j >= 0 and arr[j] > temp: arr[j+1] = arr[j] j -= 1 arr[j+1] = temp return arr
# 选择排序 for i in range(0,len(arr)-1): for j in range(i+1,len(arr)): if arr[i] > arr[j]: arr[i],arr[j] = arr[j],arr[i] return arr
# 冒泡排序 for i in range(len(arr)-1,0,-1): for j in range(0,i): if arr[j] > arr[j+1]: arr[j],arr[j+1] = arr[j+1],arr[j] return(arr)