Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Group

Searching Algorithms for Ordered Lists

Algorithms that find a key in a list or array arranged by value, such as binary search, interpolation search, jump search, exponential search and Fibonacci search. An algorithm belongs here when its cited article describes searching a sorted array or ordered list. It excludes search trees, which are data structures, and the heuristic graph searches that explore a network of states. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.

Browse By
Searching Algorithms for Ordered Lists
Filter Results6 entries
Sources
Wikipedia: Interpolation Search
Wikimedia FoundationHas Member: Interpolation Search, Lead section
Quote, Has Member: Interpolation Search, Lead section
array that has been ordered by numerical values
View the Source
Wikipedia: Jump search
Has Member: Jump Search Algorithm, Lead section
Quote, Has Member: Jump Search Algorithm, Lead section
a search algorithm for ordered lists
View the Source
Wikipedia: Fibonacci search technique
Has Member: Fibonacci Search Algorithm, Lead section
Quote, Has Member: Fibonacci Search Algorithm, Lead section
method of searching a sorted array
View the Source
Binary search (Wikipedia)
Has Member: Binary Search Algorithm, Lead section
Quote, Has Member: Binary Search Algorithm, Lead section
finds the position of a target value within a sorted array
View the Source
Wikipedia: Exponential search
Has Member: Exponential Search Algorithm, Lead
Quote, Has Member: Exponential Search Algorithm, Lead
In computer science, an exponential search (also called doubling search or galloping search or Struzik search) is an algorithm, created by Jon Bentley and Andrew Chi-Chih Yao in 1976, for searching sorted, unbounded/infinite lists.
View the Source
Wikipedia: Ternary search
Has Member: Ternary Search Algorithm, Lead
Quote, Has Member: Ternary Search Algorithm, Lead
A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a unimodal function.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.