冒泡排序
a = [9,2,3,1,6,7,0]
# 确定循环次数为 列表长度-1次
times = len(a) -1
while times > 0:
for i in range(times):
if a[i] < a[i+1]:
a[i],a[i+1]=a[i+1],a[i]
times = times -1
print(a)
99乘法表
for i in range(1,10):
for j in range(1,i+1):
print(’{0}{1}={2}’.format(i,j,ij),end=’\t’)
print()