Bubble sort：

sometimes referred to as sinking sort, is a simple sorting algorithmthat repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. （from WIKI）

每相鄰的兩個(gè)數(shù)比較，大的下沉，小的上浮

Ps: 假設(shè)有這樣一個(gè)數(shù)組 int[] a = { a1,a2,a3,a4,a5,a6}；

1 a[0]與a[1] a[1]與a[2] a[2]與a[3] a[3]與a[4] a[4]與a[5] 得到a[5]

2 a[0]與a[1] a[1]與a[2] a[2]與a[3] a[3]與a[4] 得到a[4]

3 a[0]與a[1] a[1]與a[2] a[2]與a[3] 得到a[3]

4 a[0]與a[1] a[1]與a[2] 得到a[2]

5 a[0]與a[1] 得到a[1] over

典型的for循環(huán)嵌套，一個(gè)控制行（比較的次數(shù)），一個(gè)控制列數(shù)（每次比較需要循環(huán)的次數(shù)）。為了更直觀，貼圖一張：By Swfung8-Own work, bubble sort GIF

代碼實(shí)現(xiàn)：

Swap方法：

Select Sort：

The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.（from WIKI）

簡單來說：

先從數(shù)組中找出最小的排列在左側(cè)的sorted sublist，然后在剩下的unsorted element里找出最小的元素添加到左側(cè)的sorted sublist，好比蛇通象最終形成一個(gè)有序的數(shù)組。

為了更直觀，貼圖一張，By Joestape89 at the English language Wikipedia, CC BY-SA 3.0, select sort GIF

代碼實(shí)現(xiàn)：

牽涉到算法的具體分析方面，本人還在fighting中，故不做分析。。。