冒泡排序與選擇排序

標籤：結束   strong   str   選擇   style   最大值   color   比較   array   

樣本數組：

$array = [62, 88, 58, 47, 62, 35, 73, 51, 99, 37, 93];

一、冒泡排序

將數組分為有序和無序兩部分，無序序列中的相鄰元素進行比較，如果前面的元素值大於後邊的元素值，兩者交換，第一輪排序後，最大值（99）會放入有序序列的最前邊（10的位置），即有序序列中的元素為[99]，如下所示：

Array ( [0] => 62 [1] => 58 [2] => 47 [3] => 62 [4] => 35 [5] => 73 [6] => 51 [7] => 88 [8] => 37 [9] => 93 [10] => 99 ) 

第二輪排序，同理，無序序列中從第一個元素開始，相鄰元素相比較，如果前者大於後者，交換資料，在9的位置結束（10為有序序列的位置），第二輪排序結束後，第二輪的最大元素插入有序序列的最前邊（93在9的位置），即有序序列的元素為[93,99]，結果如下所示：

Array ( [0] => 58 [1] => 47 [2] => 62 [3] => 35 [4] => 62 [5] => 51 [6] => 73 [7] => 37 [8] => 88 [9] => 93 [10] => 99 )

以此類推，經過10輪完成排序，如下：

第1次排序結束
Array ( [0] => 62 [1] => 58 [2] => 47 [3] => 62 [4] => 35 [5] => 73 [6] => 51 [7] => 88 [8] => 37 [9] => 93 [10] => 99 ) 

第2次排序結束
Array ( [0] => 58 [1] => 47 [2] => 62 [3] => 35 [4] => 62 [5] => 51 [6] => 73 [7] => 37 [8] => 88 [9] => 93 [10] => 99 ) 

第3次排序結束
Array ( [0] => 47 [1] => 58 [2] => 35 [3] => 62 [4] => 51 [5] => 62 [6] => 37 [7] => 73 [8] => 88 [9] => 93 [10] => 99 ) 

第4次排序結束
Array ( [0] => 47 [1] => 35 [2] => 58 [3] => 51 [4] => 62 [5] => 37 [6] => 62 [7] => 73 [8] => 88 [9] => 93 [10] => 99 ) 

第5次排序結束
Array ( [0] => 35 [1] => 47 [2] => 51 [3] => 58 [4] => 37 [5] => 62 [6] => 62 [7] => 73 [8] => 88 [9] => 93 [10] => 99 ) 

第6次排序結束
Array ( [0] => 35 [1] => 47 [2] => 51 [3] => 37 [4] => 58 [5] => 62 [6] => 62 [7] => 73 [8] => 88 [9] => 93 [10] => 99 ) 

第7次排序結束
Array ( [0] => 35 [1] => 47 [2] => 37 [3] => 51 [4] => 58 [5] => 62 [6] => 62 [7] => 73 [8] => 88 [9] => 93 [10] => 99 ) 

第8次排序結束
Array ( [0] => 35 [1] => 37 [2] => 47 [3] => 51 [4] => 58 [5] => 62 [6] => 62 [7] => 73 [8] => 88 [9] => 93 [10] => 99 ) 

第9次排序結束
Array ( [0] => 35 [1] => 37 [2] => 47 [3] => 51 [4] => 58 [5] => 62 [6] => 62 [7] => 73 [8] => 88 [9] => 93 [10] => 99 ) 

第10次排序結束
Array ( [0] => 35 [1] => 37 [2] => 47 [3] => 51 [4] => 58 [5] => 62 [6] => 62 [7] => 73 [8] => 88 [9] => 93 [10] => 99 ) 

 

二、選擇排序

將數組分為有序與無序兩部分，有序序列在前邊，無序序列在後邊，每一輪排序將無序序列中的第一個元素與剩餘元素進行比較，找到最小元素後放到有序序列的最後。

第一輪排序，有序序列預設為空白，找出數組中的最小元素（35），放入有序序列中（有序序列元素只有35一個元素），結果如下：

Array ( [0] => 35 [1] => 88 [2] => 62 [3] => 58 [4] => 62 [5] => 47 [6] => 73 [7] => 51 [8] => 99 [9] => 37 [10] => 93 ) 

以此類推，10輪排序後結束，如下：

第1次排序結束
Array ( [0] => 35 [1] => 88 [2] => 62 [3] => 58 [4] => 62 [5] => 47 [6] => 73 [7] => 51 [8] => 99 [9] => 37 [10] => 93 ) 

第2次排序結束
Array ( [0] => 35 [1] => 37 [2] => 88 [3] => 62 [4] => 62 [5] => 58 [6] => 73 [7] => 51 [8] => 99 [9] => 47 [10] => 93 ) 

第3次排序結束
Array ( [0] => 35 [1] => 37 [2] => 47 [3] => 88 [4] => 62 [5] => 62 [6] => 73 [7] => 58 [8] => 99 [9] => 51 [10] => 93 ) 

第4次排序結束
Array ( [0] => 35 [1] => 37 [2] => 47 [3] => 51 [4] => 88 [5] => 62 [6] => 73 [7] => 62 [8] => 99 [9] => 58 [10] => 93 ) 

第5次排序結束
Array ( [0] => 35 [1] => 37 [2] => 47 [3] => 51 [4] => 58 [5] => 88 [6] => 73 [7] => 62 [8] => 99 [9] => 62 [10] => 93 ) 

第6次排序結束
Array ( [0] => 35 [1] => 37 [2] => 47 [3] => 51 [4] => 58 [5] => 62 [6] => 88 [7] => 73 [8] => 99 [9] => 62 [10] => 93 ) 

第7次排序結束
Array ( [0] => 35 [1] => 37 [2] => 47 [3] => 51 [4] => 58 [5] => 62 [6] => 62 [7] => 88 [8] => 99 [9] => 73 [10] => 93 ) 

第8次排序結束
Array ( [0] => 35 [1] => 37 [2] => 47 [3] => 51 [4] => 58 [5] => 62 [6] => 62 [7] => 73 [8] => 99 [9] => 88 [10] => 93 ) 

第9次排序結束
Array ( [0] => 35 [1] => 37 [2] => 47 [3] => 51 [4] => 58 [5] => 62 [6] => 62 [7] => 73 [8] => 88 [9] => 99 [10] => 93 ) 

第10次排序結束
Array ( [0] => 35 [1] => 37 [2] => 47 [3] => 51 [4] => 58 [5] => 62 [6] => 62 [7] => 73 [8] => 88 [9] => 93 [10] => 99 ) 

 

兩者共同點：

將數組分為有序序列與無序序列，將每輪篩選出來的元素插入有序序列，黃的部分為有序序列

不同點：

冒泡排序——相鄰元素比較，找出最大值，放入有序序列的最前邊；

選擇排序——用無序序列中的第一個元素與剩餘無序序列元素進行比較，找出最小元素，插入有序序列的最後邊

 

冒泡排序與選擇排序