User:Rkrish67/Books/Design Analysis Algorithms: Difference between revisions

Revision as of 05:50, 24 May 2014

Latest revision as of 08:19, 15 October 2021

(One intermediate revision by one other user not shown)

Line 22:

<td><!--

-->{{#switch:{{NAMESPACE}}

|{{ns:2}}|{{ns:3}}=This '''[[Wikipedia:Books|user book]]''' is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see '''[[Help:Books]]''' (general tips) and '''[[WP:WBOOKS|WikiProject Wikipedia-Books]]''' (questions and assistance). [[Category:WikipediaUser booksnamespace (userbook books)pages|{{SUBPAGENAME}}]]{{DEFAULTSORT:{{SUBPAGENAME}}}}

|{{ns:108}}|{{ns:109}}=This is a '''[[Wikipedia:Books|Wikipedia book]]''', a collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. For information and help on Wikipedia books in general, see '''[[Help:Books]]''' (general tips) and '''[[Wikipedia:WikiProject Wikipedia-Books|WikiProject Wikipedia-Books]]''' (questions and assistance).

{{#switch:{{BASEPAGENAME}}

Line 116:

:[[Dynamic programming]]

;Selected algorithms

:[[Graph theory]]

:[[Topological sorting]]

:[[Dependency graph]]

:[[Tsort (Unix)]]

:[[Prim's algorithm]]

:[[Minimum spanning tree]]

:[[Distributed minimum spanning tree]]

:[[Euclidean minimum spanning tree]]

:[[Minimum spanning tree]]

:[[Bellman–Ford algorithm]]

:[[String searching algorithm]]

Line 136 ⟶ 137:

:[[Randomized algorithms as zero-sum games]]

:[[Monte Carlo algorithm]]

:[[SimplexApproximation algorithm]]

:[[Asymptotic computational complexity]]

:[[Simplex algorithm]]

:[[Polynomial-time approximation scheme]]

;Complexity analysis

:[[Big O notation]]

:[[Asymptotic computational complexity]]

:[[Simplex algorithm]]

:[[Polynomial-time approximation scheme]]

:[[NP-hard]]

:[[NP-complete]]