Revision as of 14:59, 5 September 2011 edit Lpantano (talk \| contribs) 23 edits mNo edit summary ← Previous edit		Revision as of 09:55, 23 November 2011 edit undo Jalal0 (talk \| contribs) 1,357 edits No edit summary Next edit →
Line 115: The [[A]] algorithm is listed as a graph search algorithm, while [[Dijkstra's algorithm]], which in fact is a special case of the A algorithm, is listed as a shortest path finder. But what is really the difference between search algorithms and shortest path algorithms? May I suggest a merge of the two sections? —[[User:Kri\|Kri]] ([[User talk:Kri\|talk]]) 19:31, 22 August 2011 (UTC) == Page request == I suggest creating a page on [[Computational complexity of common algorithms]] similar to [[Computational complexity of mathematical operations]], can serve as a very useful reference page to those comparing the computational complexity of an algorithm ([[User:Jalal0\|Jalal0]] ([[User talk:Jalal0\|talk]]) 09:55, 23 November 2011 (UTC)).

Talk:List of algorithms: Difference between revisions