Essential Search Algorithms  (English, Paperback, Muthukrishnan)

Delve into the heart of computational thinking with this book. From fundamental concepts to advanced techniques, this book offers clear explanations, engaging visualizations, and hands-on Python code for every algorithm. Explore the essential searching algorithms with a minimal implementation approach. Access the complete source code on GitHub for further exploration. This book is organized into six parts: Basic Search Algorithms - Linear search, Binary Search, Ternary Search, Jump Search, Indexed Sequential Search, Interpolation Search, Exponential Search, Fibonacci Search, Hash-Based Search, Hash Table Search, Bloom Filter and Cuckoo Filter AI Search Algorithms - Hill Climbing Algorithm, Monte Carlo Tree Search (MCTS), Simulated Annealing, Branch and Bound Algorithms, Tabu search, Beam search, Iterative Deepening Depth-First Search (IDDFS), Ant Colony Optimization (ACO), Nearest Neighbor Search Graph Search Algorithms - Basics, Depth First Search (DFS), Breadth-first search (BFS), Uniform Cost Search, Greedy Best-First Search, A* Search Algorithm, B* Search Algorithm, Dijkstra’s algorithm, Bidirectional Search, Kruskal’s Algorithm, Prim’s Algorithm, Floyd-Warshall algorithm, The Bellman-Ford algorithm Text and String Matching Algorithms - Suffix Array, Boyer-Moore Algorithm, Knuth-Morris-Pratt (KMP) Algorithm, Rabin-Karp Algorithm, Levenshtein distance Data Structures for Search - Trie search, Ternary Search Tree (TST), Stack, Heap, P-Queue and more