Quick Dictionary - Searching
What is Linear Search?
A simple algorithm that sequentially searches through a list or array to find a target element, checking each element until a match is found or the end of the list is reached.
What is Binary Search ?
An efficient algorithm that divides a sorted list or array into halves, repeatedly narrowing down the search range by comparing the target element with the middle element until the target is found or determined to be absent.
What is DFS?
Depth-First Search (DFS): A graph traversal algorithm that explores as far as possible along each branch before backtracking, visiting all adjacent vertices of a current vertex before moving to the next unvisited vertex.
What is BFS?
Breadth-First Search (BFS): A graph traversal algorithm that systematically explores all the vertices of a graph level by level, visiting all the neighbors of a vertex before moving to the next level.
What is Uniform Cost Search?
Uniform Cost Search (UCS): A graph search algorithm that expands the node with the lowest cost, considering the cumulative cost from the start node to the current node, effectively finding the optimal path in terms of total cost.
What is Best-First Search?
Best-First Search: A graph search algorithm that uses a heuristic function to evaluate the desirability of nodes, prioritizing exploration towards the most promising nodes first.
What is A*search?
A* Search: An informed graph search algorithm that combines the advantages of best-first search and uniform cost search, using both a heuristic function and cumulative cost to guide the search and find the optimal path efficiently.
What is IDDFS?
Iterative Deepening Depth-First Search (IDDFS): A combination of depth-first search and breadth-first search, which repeatedly performs depth-limited depth-first searches with increasing depth limits until the goal is found
What is Bidirectional Search?
Bidirectional Search: A graph search algorithm that explores from both the start and goal nodes simultaneously, meeting in the middle when the searches converge, often resulting in a more efficient search.
What is Greedy Search?
Greedy Search: A heuristic search algorithm that selects the most promising option at each step, based solely on the heuristic information, without considering the long-term consequences, which may not guarantee an optimal solution.
What is heuristic Search?
An iterative heuristic search algorithm that makes incremental changes to the current solution by selecting the neighboring solution with the best heuristic value, in an attempt to reach a local optimum.
What is Probabilistic Optimization Search?
A probabilistic optimization algorithm inspired by annealing in metallurgy, which accepts uphill moves with a decreasing probability, allowing the algorithm to escape local optima and explore the solution space more effectively.
What is Tabu Search?
A metaheuristic algorithm that maintains a short-term memory called a tabu list, which keeps track of recently visited solutions, guiding the search to explore different areas of the solution space.
What is Genetic Algorithm?
Genetic Algorithms: Evolutionary algorithms inspired by the principles of natural selection and genetics, using a population of candidate solutions, selection, crossover, and mutation operators to search for optimal or near-optimal solutions.
What is Ant Colony Optimisation?
Ant Colony Optimization: An optimization algorithm inspired by the behavior of ant colonies, where artificial ants deposit pheromone trails on graph edges, reinforcing paths with higher quality solutions and guiding subsequent ants towards promising areas.
What is Particle Swarm Optimisation?
Particle Swarm Optimization: An optimization algorithm inspired by the collective behavior of bird flocking or fish schooling, where particles represent potential solutions that adjust their positions based on their own best position and the global best position found by the swarm.
What is Harmony Search?
Harmony Search: An optimization algorithm inspired by the improvisation process in music, where a set of variables represents different instrument parameters, and the search is guided by generating new harmonies based on memory, pitch adjustment, and improvisation rules.
What is Quantum Search?
Quantum Search Algorithm: A search algorithm that leverages quantum mechanics principles, such as superposition and interference, to perform a parallel search on a large database and find the target element more efficiently than classical algorithms.
What is Shuffled Frog Leaping Search?
Shuffled Frog Leaping Algorithm: An optimization algorithm inspired by the behavior of frog populations, where frogs represent potential solutions, and the search progresses through a series of shuffling, local search, and global search operations to converge to an optimal solution.
What is Firefly Search?
Firefly Algorithm: An optimization algorithm inspired by the flashing behavior of fireflies, where each firefly represents a potential solution, and the search progresses by adjusting the brightness and attractiveness of fireflies to find the optimal or near-optimal solution.
What is Bat Search?
An optimization algorithm inspired by the echolocation behavior of bats, where each bat represents a potential solution, and the search progresses by adjusting the position, velocity, and loudness of bats to explore the solution space and find optimal solutions.
What is Grey Wolf Optimizer?
An optimization algorithm inspired by the hunting behavior of grey wolves, where the positions of alpha, beta, and delta wolves represent the best solutions found so far, and the search progresses by simulating leadership hierarchy and hunting dynamics to improve the solutions.
What is Krill Herd Search?
An optimization algorithm inspired by the swarming behavior of krill populations, where each krill represents a potential solution, and the search progresses by adjusting the position, velocity, and size of krill individuals to explore the solution space and find optimal or near-optimal solutions.
What is Cuckoo Search?
An optimization algorithm inspired by the brood parasitic behavior of cuckoo birds, where each cuckoo represents a potential solution, and the search progresses by laying eggs (solutions) in host nests, mimicking the Levy flight behavior to explore the solution space and find optimal or near-optimal solutions.
What is Sentinel Search?
Sentinel Search: A variation of linear search that uses a sentinel value to eliminate the need for explicit boundary checks within the loop.
What is Interpolation Search?
A variation of binary search that uses an interpolation formula to estimate the position of the target element, making it more efficient for uniformly distributed datasets.
What is Exponential Search?
A variation that finds a range in which the target element is likely to be located, and then performs binary search within that range.
What is Ternary Search?
A variation of Binary search, It divides the search space into three parts instead of two, reducing the search space by one-third at each step.
What is Transposition Search?
A variation of Binary search, that reorders the elements during the search based on the access patterns, aiming to improve cache efficiency
What is Depth Limit Search?
Depth-Limited Search: Depth first search DFS variation that restricts the depth of exploration to a specified limit, avoiding infinite loops in infinite graphs or reducing the search space.
What is Bidirectional Search?
A BFS variation that performs two simultaneous BFS searches, one from the start node and one from the goal node, meeting in the middle.
What is Parallel BFS?
Parallel Breadth-First Search: A BFS variation that utilizes parallel processing to explore different branches of the graph simultaneously, improving performance.
What is Greedy BFS?
Greedy Best-First Search: A BFS variation that prioritizes nodes solely based on the heuristic information, without considering the cost or distance from the start node.
What is Weighted BFS?
- Weighted Best-First Search: A BFS variation that applies a weight or bias to the heuristic function, balancing between greedy behavior and optimality.
What is Iterative Deepning A* Search
Iterative Deepening A* (IDA*): A variation of A* search that gradually increases the heuristic limit, allowing for a more memory-efficient implementation.
What is Recursive Best-First Search(RBFS)?
it is a A* search variation that performs a depth-limited search around the current node, returning to the parent node and re-expanding if a better path is found.