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

Revision as of 05:11, 24 May 2014

Revision as of 05:50, 24 May 2014

Line 83:

}}

== Design_Analysis_Algorithms ==

;Data Structures

:[[Data structure]]

:[[Recurrence]]

:[[Linked data structure]]

:[[Array data structure]]

:[[Parallel array]]

:[[Associative array]]

:[[Dynamic array]]

:[[Hashed array tree]]

:[[Linked list]]

:[[Doubly linked list]]

:[[Queue]]

:[[Queue (abstract data type)]]

:[[Priority queue]]

:[[Binary tree]]

:[[Binary search tree]]

:[[Geometry of binary search trees]]

:[[Random binary tree]]

:[[Hash table]]

:[[Hash function]]

:[[Double hashing]]

;Algorithm design techniques

:[[Algorithm]]

:[[Algorithm design]]

:[[Divide and conquer algorithm]]

:[[Maximum subarray problem]]

:[[Greedy algorithm]]

:[[Activity selection problem]]

:[[Online algorithm]]

:[[Backtracking]]

:[[Backtracking line search]]

:[[Dynamic programming]]

;Selected algorithms

:[[Topological sorting]]

:[[Dependency graph]]

:[[Tsort (Unix)]]

:[[Prim's algorithm]]

:[[Distributed minimum spanning tree]]

:[[Euclidean minimum spanning tree]]

:[[Minimum spanning tree]]

:[[Bellman–Ford algorithm]]

:[[String searching algorithm]]

:[[Aho-Corasick string matching algorithm]]

:[[Rabin-Karp string search algorithm]]

:[[Knuth-Morris-Pratt algorithm]]

;Advanced algorithm design techniques

:[[Amortized Analysis]]

:[[Accounting method]]

:[[Potential method]]

:[[Probabilistic analysis of algorithms]]

:[[Randomized algorithm]]

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

:[[Monte Carlo algorithm]]

:[[Asymptotic computational complexity]]

:[[Polynomial-time approximation scheme]]

;Complexity analysis

:[[Big O notation]]

:[[Simplex algorithm]]

:[[NP-hard]]

:[[NP-complete]]