Search Algorithm: Fundamentals and Applications
ΠΡΠΈΡΠΊΠΎ Π·Π° ΡΠ°Π·ΠΈ Π΅Π»Π΅ΠΊΡΡΠΎΠ½Π½Π° ΠΊΠ½ΠΈΠ³Π°
In the field of computer science, an algorithm that is designed to solve a search problem is referred to as a search algorithm. Search algorithms are designed to retrieve information that is either saved inside of a certain data structure or calculated within the search space of a problem domain. This information can have either discrete or continuous values.
How You Will Benefit
(I) Insights, and validations about the following topics:
Chapter 1: Search Algorithm
Chapter 2: Linear Search
Chapter 3: Binary Search Algorithm
Chapter 4: Depth-First Search
Chapter 5: Breadth-First Search
Chapter 6: Best-First Search
Chapter 7: A* Search Algorithm
Chapter 8: Hill Climbing
Chapter 9: Simulated Annealing
Chapter 10: Genetic Algorithm
(II) Answering the public top questions about search algorithm.
(III) Real world examples for the usage of search algorithm in many fields.
(IV) 17 appendices to explain, briefly, 266 emerging technologies in each industry to have 360-degree full understanding of search algorithm' technologies.
Who This Book Is For
Professionals, undergraduate and graduate students, enthusiasts, hobbyists, and those who want to go beyond basic knowledge or information for any kind of search algorithm.
