Binary search algorithm
Binary search, also known as the half-interval search or binary chop, is an algorithm that finds a target value in a sorted array in O(log n) time.
Exponential search
Exponential search, also called doubling search or galloping search, is a search algorithm for sorted arrays, described by Jon Bentley and Andrew Yao in 1976.
Hierarchical navigable small world
Hierarchical navigable small world (HNSW) is a fully graph-based index for approximate nearest-neighbor search, introduced by Yu. A. Malkov and D. A. Yashunin in a 2018 IEEE paper.
Jump search
Jump search, also called block search, is a searching algorithm for sorted arrays that jumps ahead in fixed-size blocks and then linearly scans the block that could hold the target.
Linear search
Linear search is an algorithm that finds a target value in a list by checking each element in order until it finds a match or reaches the end.
Search algorithm
A search algorithm is a procedure that finds a specified value in a collection of data, such as an array or tree, or determines it is absent.