Floyd's Algorithm
From dankwiki
A method by which a heap can be constructed from a list with fewer comparisons than would be necessary iterating the general heap-insert procedure.
A method by which a heap can be constructed from a list with fewer comparisons than would be necessary iterating the general heap-insert procedure.