10大经典排序算法Python实现（待完善）

算法说明参考如下：

https://www.cnblogs.com/onepixel/articles/7674659.html

冒泡排序：

ll = [3,38,5,44,15,36,47,26,27,2,46,4,19,50,48]
a = 1
l2 = range(len(ll)-1)
while a:
    a = 0   
    for i in l2:
        if ll[i]>ll[i+1]:
            ll[i],ll[i+1]=ll[i+1],ll[i]
            a = 1
print(ll)

选择排序：

ll = [3,38,5,44,15,36,47,26,27,2,46,4,19,50,48]
l2 = range(len(ll)-1)

for i in l2:
    minindex = i
    for j in l2[i+1:]:
        if ll[j]<ll[minindex]:
            minindex = j
    ll[i],ll[minindex]=ll[minindex],ll[i]
print(ll)