About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 121. Chapters: Dijkstra's algorithm, Search algorithm, Hash table, Hash function, Binary search algorithm, Grover's algorithm, Linear search, String searching algorithm, Genetic algorithm, Brute-force search, Minimax, A* search algorithm, Depth-first search, Interpolation search, Breadth-first search, Best-first search, Alpha-beta pruning, Rabin-Karp string search algorithm, Fractional cascading, Knuth-Morris-Pratt algorithm, Universal hashing, Rainbow table, Backjumping, Nearest neighbor search, Backtracking, Siamese method, Boyer-Moore string search algorithm, Knuth's Algorithm X, Locality sensitive hashing, K-nearest neighbor algorithm, Difference map algorithm, Extendible hashing, Hill climbing, Bitap algorithm, Inverted index, Cuckoo hashing, D*, All nearest smaller values, Lexicographic breadth-first search, Lookahead, Geometric hashing, B*, Dancing Links, Look-ahead, Boyer-Moore-Horspool algorithm, Iterative deepening depth-first search, Amplitude amplification, Spreading activation, Hopscotch hashing, God's algorithm, Linear hashing, Aho-Corasick string matching algorithm, Perfect hash function, Bidirectional search, Uniform-cost search, Null-move heuristic, Beam search, Fibonacci search technique, Rapidly-exploring random tree, Incremental heuristic search, Expectiminimax tree, Search games, IDA*, SSS*, Depth-limited search, C-Link, Linear probing, Index mapping, Any-angle path planning, Jump search, Range Minimum Query, Double hashing, UUHash, Ternary search tree, MTD-f, DSW algorithm, Graphplan, Variation, Deducting Search Algorithm, Dynamic perfect hashing, Uniform binary search, Search suggest drop-down list, State space search, Dichotomic search, MaMF, SMA*, Stack search, Beam stack search, Proof-number search, Late Move Reductions, Best Bin First, Zhu-Takaoka string matching algorithm, Rapidly-exploring dense trees...
