Talk:Cheney's algorithm: Difference between revisions

Revision as of 10:51, 4 July 2015

Revision as of 08:51, 30 January 2016

Line 23:

Breadth first search gives good locality of reference for most paths for accesses close to the root. Depth first search gives great locality of reference for a single path from the root, and awful locality for everything else. In most cases, I think BFS will actually perform better, not worse. In this case there is no such thing as *worst*: performance will vary between use cases. <small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/82.132.224.134|82.132.224.134]] ([[User talk:82.132.224.134|talk]]) 10:50, 4 July 2015 (UTC)</small><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->

== Algorithm Example ==

The algorithm example is recursive, and has no indentation. The whole idea behind Cheney is to avoid recursion. It needs to be replaced. [[User:SamRushing|SamRushing]] ([[User talk:SamRushing|talk]])