Introduction - If you have any usage issues, please Google them yourself
Heap sort is a tree selection sort, the sort process, the R [1 .. N] as the order of a complete binary tree storage structure, the use of complete binary tree in the parent node and child node of the intrinsic relationship between the elements to select the minimum.