Description: Select Sort:
Divided into direct selection sort, heap sort
Direct selection Sort by: i select i to array.Length the middle of the smallest value in the position i.
Heap sort: First, the traversal order of the array inside the level to put a complete binary tree. From the last non-terminal node Wang Qianmian adjustment, until it reaches the root node, this time other than the root node non-terminal node have met the condition of the heap, so the need to adjust the root node makes the whole tree to meet the conditions of the heap, so root node along its sons go to the following (maximum heap walking along the eldest son, the minimum heap walking along the youngest son). Inside the main program, first began to adjust from a non-terminal node to the root After adjustment, to form a heap, then the root of the heap on the back (ie: each tree size will change, but the root is in position to facilitate the calculation of the index of the sons, so if necessary, in ascending order, they
To Search:
File list (Check if you may need any files):
SelectionSort.java
Download