Talk:Cheney's algorithm: Difference between revisions

Content deleted Content added
Assessment: +Computer Science (assisted)
Regarding Efficiency: Clarification on efficiency
Tags: Mobile edit Mobile web edit
Line 21:
 
[[Special:Contributions/212.95.7.81|212.95.7.81]] ([[User talk:212.95.7.81|talk]]) 01:26, 15 March 2013 (UTC)
 
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.