冒泡

for i ~[1,n-1]
    for j ~ [0,n-i-i]
        if a[j] < a[j+1]
            swap

冒泡改进

带标记改进
k = n-1
    bool flag = true;
    while flag 
        flag = false

        for j ~ [0,k-1]
            if a[j] > a[j+1]
                swap
                flag = true

        k -= 1  

选择

for i ~ [0,n-2]
        k = i
        for j ~ [i+1,n-1]
            if a[j] < a[k]
                k = j

        if i != k
            swap

插入

for i ~ [1,n-1]
        vip = a[i]
        j = i-1
        while a[j] > vip and j >=0
            a[j+1] = a[j]
            j --
        a[j+1] = vip

冒泡改进（带位置）

pos = n-1
    while pos > 0
        k = pos
        pos = 0

        for j ~ [0,k]
            if a[j] > a[j+1]
                swap
                pos = j+1

—— 本文来自火龙信奥（义乌睿码科技）：义乌青少年信息学奥赛与编程教育平台，专注 CSP-J/S、NOIP、GESP 竞赛培训，线上线下融合教学，助力编程升学。网址：hlcoding.com