Floyd's Algorithm

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]]

Floyd's Algorithm: Difference between revisions

Revision as of 08:54, 4 October 2009 view source Dank (talk \| contribs) Bureaucrats, Administrators 11,305 edits Created page with 'CATEGORY: Computer Science Eponyms'		Latest revision as of 19:00, 11 April 2013 view source Dank (talk \| contribs) Bureaucrats, Administrators 11,305 edits 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]]