Various sorting methods and their comparison

1. Simple sorting

2. Tree selection sorting

Idea: Set the number of 221 groups in an array, the larger number (or smaller number) as the parent of the two numbers, and then build a complete binary tree. The root node of the tree is the maximum number. After outputting the number, the corresponding leaf node is replaced by negative infinity. The binary tree is then rebuilt on this basis until all nodes are negative infinity.

Complexity: The complexity of the first value is N, the complexity of the other values is log2 (n), and the average complexity is NLOG2 (n). (The complexity of the delete and insert operation of the binary tree is O (logk)?) ）

Auxiliary space O (n).

3. Heap Sequencing

Various sorting methods and their comparison