Search algorithm
This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
(Learn how and when to remove this template message)

In computer science, a search algorithm is any algorithm which solves the search problem, namely, to retrieve information stored within some data structure, or calculated in the search space of a problem domain. Examples of such structures include but are not limited to a linked list, an array data structure, or a search tree. The appropriate search algorithm often depends on the data structure being searched, and may also include prior knowledge about the data. Searching also encompasses algorithms that query the data structure, such as the SQL SELECT command.^{[1]}^{[2]}
Search algorithms can be classified based on their mechanism of searching. Linear search algorithms check every record for the one associated with a target key in a linear fashion.^{[3]}^{[4]} Binary, or half interval searches, repeatedly target the center of the search structure and divide the search space in half. Comparison search algorithms improve on linear searching by successively eliminating records based on comparisons of the keys until the target record is found, and can be applied on data structures with a defined order.^{[4]} Digital search algorithms work based on the properties of digits in data structures that use numerical keys.^{[5]} Finally, hashing directly maps keys to records based on a hash function.^{[6]} Searches outside a linear search require that the data be sorted in some way.
Search functions are also evaluated on the basis of their complexity, or maximum theoretical run time. Binary search functions, for example, have a maximum complexity of O(log n), or logarithmic time. This means that the maximum number of operations needed to find the search target is a logarithmic function of the size of the search space.
Contents
Classes
For virtual search spaces
Algorithms for searching virtual spaces are used in the constraint satisfaction problem, where the goal is to find a set of value assignments to certain variables that will satisfy specific mathematical equations and inequations / equalities. They are also used when the goal is to find a variable assignment that will maximize or minimize a certain function of those variables. Algorithms for these problems include the basic bruteforce search (also called "naïve" or "uninformed" search), and a variety of heuristics that try to exploit partial knowledge about the structure of this space, such as linear relaxation, constraint generation, and constraint propagation.
An important subclass are the local search methods, that view the elements of the search space as the vertices of a graph, with edges defined by a set of heuristics applicable to the case; and scan the space by moving from item to item along the edges, for example according to the steepest descent or bestfirst criterion, or in a stochastic search. This category includes a great variety of general metaheuristic methods, such as simulated annealing, tabu search, Ateams, and genetic programming, that combine arbitrary heuristics in specific ways.
This class also includes various tree search algorithms, that view the elements as vertices of a tree, and traverse that tree in some special order. Examples of the latter include the exhaustive methods such as depthfirst search and breadthfirst search, as well as various heuristicbased search tree pruning methods such as backtracking and branch and bound. Unlike general metaheuristics, which at best work only in a probabilistic sense, many of these treesearch methods are guaranteed to find the exact or optimal solution, if given enough time. This is called "completeness".
Another important subclass consists of algorithms for exploring the game tree of multipleplayer games, such as chess or backgammon, whose nodes consist of all possible game situations that could result from the current situation. The goal in these problems is to find the move that provides the best chance of a win, taking into account all possible moves of the opponent(s). Similar problems occur when humans or machines have to make successive decisions whose outcomes are not entirely under one's control, such as in robot guidance or in marketing, financial, or military strategy planning. This kind of problem — combinatorial search — has been extensively studied in the context of artificial intelligence. Examples of algorithms for this class are the minimax algorithm, alpha–beta pruning, * Informational search ^{[7]} and the A* algorithm.
For substructures of a given structure
The name "combinatorial search" is generally used for algorithms that look for a specific substructure of a given discrete structure, such as a graph, a string, a finite group, and so on. The term combinatorial optimization is typically used when the goal is to find a substructure with a maximum (or minimum) value of some parameter. (Since the substructure is usually represented in the computer by a set of integer variables with constraints, these problems can be viewed as special cases of constraint satisfaction or discrete optimization; but they are usually formulated and solved in a more abstract setting where the internal representation is not explicitly mentioned.)
An important and extensively studied subclass are the graph algorithms, in particular graph traversal algorithms, for finding specific substructures in a given graph — such as subgraphs, paths, circuits, and so on. Examples include Dijkstra's algorithm, Kruskal's algorithm, the nearest neighbour algorithm, and Prim's algorithm.
Another important subclass of this category are the string searching algorithms, that search for patterns within strings. Two famous examples are the Boyer–Moore and Knuth–Morris–Pratt algorithms, and several algorithms based on the suffix tree data structure.
Search for the maximum of a function
In 1953, American statistician Jack Kiefer devised Fibonacci search which can be used to find the maximum of a unimodal function and has many other applications in computer science.
For quantum computers
There are also search methods designed for quantum computers, like Grover's algorithm, that are theoretically faster than linear or bruteforce search even without the help of data structures or heuristics.
See also
 Category:Search algorithms
 Backward induction
 Contentaddressable memory hardware
 Dualphase evolution
 Linear search problem
 No free lunch in search and optimization
 Recommender systems also use statistical methods to rank results in very large data sets
 Search engine (computing)
 Search game
 Selection algorithm
 Solver
 Sorting algorithms necessary for executing certain search algorithms
 Web search engine
References
Citations
 ^ Beame & Fich 2002, p. 39.
 ^ Knuth 1998, §6.5 ("Retrieval on Secondary Keys").
 ^ Knuth 1998, §6.1 ("Sequential Searching").
 ^ Knuth 1998, §6.2 ("Searching by Comparison of Keys").
 ^ Knuth 1998, §6.3 (Digital Searching).
 ^ Knuth 1998, §6.4, (Hashing).
 ^ Kagan E. and BenGal I. (2014). "A GroupTesting Algorithm with Online Informational Learning" (PDF). IIE Transactions, 46:2, 164184,.
Bibliography
Books
 Knuth, Donald (1998). Sorting and Searching. The Art of Computer Programming. 3 (2nd ed.). Reading, MA: AddisonWesley Professional.
Articles
 Schmittou, Thomas; Schmittou, Faith E. (20020801). "Optimal Bounds for the Predecessor Problem and Related Problems". Journal of Computer and System Sciences. 65 (1): 38–72. doi:10.1006/jcss.2002.1822.
External links
 Uninformed Search Project at the Wikiversity.
 Unsorted Data Searching Using Modulated Database.