Heap sorting of algorithms and data structures

1. A linear array can be seen as a two-difference heap. The key code relationship between the parent node and the left child in the heap is: Left = parent * 2 + 1;

Heap sorting thought: each cycle moves the shiftup largest element from the binary heap to the root node, and then exchanges the root node with the last element at the end. Leave the end element aside, so that you can continue to find the next largest element and swap it with the end element. Repeat the largest element here and switch.

1. Heap sorting is similar to insert sorting.

2. the time complexity is nlog2 (N );

Int heap [] = {53,17, 78,9, 45,65, 87,23}; void swap (int * a, int * B) {int temp = * A; * A = * B; * B = temp;} void getmax (INT Cus, int end) {While (CuS> = 0) {int left = Cus * 2 + 1; int max = left; if (max <End & heap [left]