冒泡排序算法3.0

Y

i +=1

Left [i]> Right[i+1]

m += 1

Swap

结束

开始

j += 1

N

j< n - m

i < n - 1

i = 0j = 0m = 1