Essential Search Algorithms: Navigating the Digital Maze

by Muthu Krishnan

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 using graph traversals, and dynamic programming, gaining practical insights that go beyond theoretical knowledge. With a minimal implementation approach, readers can experiment, extend, and optimize, fostering a deeper understanding. Access the complete source code on GitHub for further exploration. Whether you're a beginner or an experienced coder, this book equips you with the tools to navigate the intricate landscape of algorithms and computational problem-solving.

This book is organized into six

Basic Search Algorithms
2. Linear search
3. Binary Search
4. Ternary Search
5. Jump Search
6. Indexed Sequential Search
7. Interpolation Search
8. Exponential Search
9. Fibonacci Search

Hash-Based Search
10. Hash Table Search
11. Bloom Filter
12. Cuckoo Filter

AI Search Algorithms
13. Hill Climbing Algorithm
14. Monte Carlo Tree Search (MCTS)
15. Simulated Annealing
16. Branch and Bound Algorithms
17. Tabu search
18. Beam search
19. Iterative Deepening Depth-First Search (IDDFS)
20. Ant Colony Optimization (ACO)
21. Nearest Neighbor Search

Graph Search Algorithms
22. Basics
23. Depth First Search (DFS)
24. Breadth first search (BFS)
25. Uniform Cost Search
26. Greedy Best-First Search
27. A* Search Algorithm
28. B* Search Algorithm
29. Dijkstra’s algorithm
30. Bidirectional Search
31. Kruskal’s Algorithm
32. Prim’s Algorithm
33. Floyd-Warshall algorithm
34. The Bellman-Ford algorithm

Text and String Matching Algorithms
35. Suffix Array
36. Boyer-Moore Algorithm
37. Knuth-Morris-Pratt (KMP) Algorithm
38. Rabin-Karp Algorithm
39. Levenshtein distance

Data Structures for Search
40. Trie search
41. Ternary Search Tree (TST)

Kindle Edition

Published December 9, 2023