Sorting Algorithms

Sorting algorithms:

Def: are used to arrange the data into some order.（以某种特定的方式排列数据）

Bubble Sort:

Def: to arrange the data to ascending or descending order. (以升序或者降序的方式排列数据)

Insertion sort algorithm:

Def: begin by looking at the first two elements of the array.We compare these elements and, if necessary, we swap them so they are in the proper order.Then, our objective is to incorporate the third element of the array into the part of the array already sorted. We do this by inserting it into proper position, relative to the first two elements. If we need to shift either of the first two elements to accommodate the third element, we do so. Once we have inserted the third element into the correct position (relative to the first two elements), the initial portion of the array consisting of the first three elements will be sorted.
1.给前两个元素排序，

2.将数组的第三个元素插入到前两个元素中适当的位置。把它合并到已经排序的数组中。

如果我们需要移动前两个元素中的任何一个来容纳第三个元素，我们就这样做。一旦我们将第三个元素插入到正确的位置(相对于前两个元素)，由前三个元素组成的数组的初始部分将被排序。

selection sort algorithm:

Def: The selection sort works like this: The smallest value in the array is located and moved to position 0. Then, the next smallest value is located and moved to position 1. This process continues until all of the elements have been placed in their proper order. Let's see how the selection sort works when arranging the elements of the array in Figure 17-8.
1.对数组中最小的值进行定位，并将其移动到位置0。

2.再定位下一个最小值，并移动到位置1。

循环以上过程，直到所有元素都按适当的顺序放置。