NIST

dominance tree sort

(algorithm)

Definition: (no definition here, yet, but you can help.)

See also tournament sort, Fibonacci heap.

Note: "Heaps are dominance trees, but not all dominance trees are heaps."

Richard Harter's description.


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 23 May 2022.
HTML page formatted Mon May 23 13:08:57 2022.

Cite this as:
"dominance tree sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 23 May 2022. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/dominanceTreeSort.html