This method converts an array of data into a partially ordered binary tree in which every node is greater than or equal to each of its two children.
This method converts an array of data into a partially ordered binary tree in which every node is greater than or equal to each of its two children. Then it sorts the data in reverse by repeatedly placing the largest unsorted element in its correct place. The data structure it uses gives it its name.
This method converts an array of data into a partially ordered binary tree in which every node is greater than or equal to each of its two children.
heap sort