冒泡排序算法

# coding:utf-8
#！/usr/bin/evn python
li = [11,2,34,6,54,13]
for n in range(len(li)-1):
    for m in range(n+1,len(li)):
        if li[m]<li[n]:
            temp = li[m]
            li[m] = li[n]
            li[n] = temp
print li