冒泡排序的算法描述 24 78 78 78 78 78 24 69 69 69 12 24 46 46 46 14 69 12 24 26 2 26 14 46 12 24 8 26 14 26 12 69 26 14 14 12 (1)do the following N-1 times: 46 46 8 (1.1)point to the first element; start end (1.2)do the following N-1 times: (1.2.1)compare the element pointed to with the next element; (1.2.2)if the compared elements are in the wrong order,exchange them; (1.2.3)point to the next element.冒泡排序的算法描述