冒泡排序法

#V1.0 任意输入两个数，大的放后面，小的放前面
a=int(input("输入a"))  #输入一个数a
b=int(input("输入b"))   #输入一个数b
print("a=",a,"   ","b=",b)
if(a>b):
    tmp=a
    a=b
    b=tmp
    print("a=", a, "   ", "b=", b)    #满足上面的条件才打印输出
#print("a=", a, "   ", "b=", b)       #不满足a>b也打印输出a,b的值

#V1.0 任意输入两个数，大的放后面，小的放前面
a=int(input("输入a"))   #输入一个数a
b=int(input("输入b"))   #输入一个数b
print("a=",a,"   ","b=",b)
if(a>b):
    tmp=a
    a=b
    b=tmp
    print("a=", a, "   ", "b=", b)    #满足上面的条件才打印输出
#print("a=", a, "   ", "b=", b)       #不满足a>b也打印输出a,b的值

#V2.0使用List列表实现一趟排序
b=[5,7,3,6,1,8,9,4,2]
ble=len(b)   #计算个数
print(b)
print(ble)     #打印ble数字的个数
print(b[0])
for i in range(0,ble-1):
    if (b[i]>b[i+1]):
        tmp = b[i]
        b[i] = b[i+1]
        b[i+1] = tmp
print(b)

#V3.0完成所有数据的排序
b=[5,7,3,6,1,8,9,4,2]
ble=len(b)   #计算个数
print("未排序:",b)
for j in range(0,ble):
    for i in range(0, ble - 1):
        if (b[i] > b[i + 1]):
            tmp = b[i]
            b[i] = b[i + 1]
            b[i + 1] = tmp
    print("第",j,"次排序:",b)
print("排序后:",b)