Check out my first novel, midnight's simulacra!
Floyd's Algorithm: Difference between revisions
From dankwiki
(Created page with 'CATEGORY: Computer Science Eponyms') |
No edit summary |
||
| Line 1: | Line 1: | ||
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. | |||
[[CATEGORY: Computer Science Eponyms]] | [[CATEGORY: Computer Science Eponyms]] | ||
Latest revision as of 19:00, 11 April 2013
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.
