要努力啊

# 插入排序 def insert_sort(lists): count = len(lists) for i in range(1, count): key = lists[i] j = i - 1 while j >= 0: if lists[j] > key: ...

public static void bubbleSort(int[] list){ boolean needNextPass = true; for(int k = 1; k < list.length && needNextPass; k++){ //k：遍历次数 needNextPass = false; for(