Linear Search
A simple method for finding an element by checking each item sequentially until the desired one is found.
Binary Search
An efficient algorithm that repeatedly divides a sorted list in half to locate a target value.
Depth‑First Search (DFS)
Explores as far as possible along each branch before backtracking, used in graph traversal.
Breadth‑First Search (BFS)
Visits all neighbors at the present depth before moving to nodes at the next depth level.
Interpolation Search
Improves on binary search for uniformly distributed sorted arrays by estimating the position.
Exponential Search
Finds a range where the target may reside and then uses binary search within that range.
Jump Search
Searches by jumping ahead fixed steps and then performing a linear search within the found block.
Sublist Search
Finds occurrences of a pattern list within a larger list, often using KMP or Rabin‑Karp algorithms.
Ternary Search
Divides the search space into three parts, useful for unimodal functions.
A* Search
Combines heuristics with path cost to efficiently find the shortest path in graphs.