User:Rkrish67/Books/Design Analysis Algorithms
|
This 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 WikiProject Wikipedia-Books (questions and assistance). | ||||||||
| [ Download PDF ] [ Download ODT ] [ Download ZIM ] | |||||||||
| [ About ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | |||||||||
Design_Analysis_Algorithms[edit]
- 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
- Graph theory
- Topological sorting
- Dependency graph
- Tsort (Unix)
- Prim's algorithm
- Minimum spanning tree
- Distributed minimum spanning tree
- Euclidean 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
- Approximation algorithm
- Simplex algorithm
- Complexity analysis
- Big O notation
- Asymptotic computational complexity
- Polynomial-time approximation scheme
- NP-hard
- NP-complete