一.冒泡排序 list = [56,12,1,8,354,10,100,34,56,7,23,456,234,-58] def MP_paixu(): for i in range(len(list)-1): for j in range(len(list)-1-i): for list[j] > list[j+1]: list[j],list[j+1] = list[j+1],list[j] return list 二.计算x的n次方的方法 def power(x,n): s = 1 whil…