Introduction - If you have any usage issues, please Google them yourself
Heap Sort (HeapSort) is a tree selection sort. Heap sort is characterized by: the sort process, the R [l.. N] as a complete binary tree structure of the order of storage, using completely binary tree in the parent node and children nodes in the internal relations between relations (see the order of the binary tree memory structure), in the present disordered select keywords maximum (or minimum) record