if len(numList) < 2:
return "List is too short"
else:
count = 1
a = {1: numList}
for i in range(len(numList)):
for j in range(0, len(numList)-i-1):
if numList[j]>numList[j+1]:
temp = numList[j]
numList[j] = numList[j+1]
numList[j+1] = temp
count +=1
a[count] = numList
print(a)
return a
a
应该在冒泡排序的每个步骤中返回一个字典,但是返回一个字典,其中包含尝试次数和键对的每对都是相同的排序列表