Search algorithm: Difference between revisions

Revision as of 15:30, 10 July 2017

Revision as of 07:36, 15 July 2017

Line 7:

In [[computer science]], a '''search algorithm''' is an [[algorithm]] that retrieves information stored within some data structure, or calculated in the [[Feasible region|search space]] of a [[problem ___domain]]. Data structures can include linked lists, arrays, search trees, hash tables, or various other storage methods. The appropriate search algorithm often depends on the data structure being searched. Searching also encompasses algorithms that query the data structure, such as the SQL SELECT command.{{Sfn|Beame|Fich|2001|p=39}}''{{Sfn|Knuth|1998|loc=§6.5 ("Retrieval on Secondary Keys")}}''

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.[[Binary search algorithm|{{Sfn|Knuth|1998|loc=§6.1 ("Sequential Searching")}}]][[Search algorithm#cite note-FOOTNOTEKnuth1998.C2.A76.1 .28.22Sequential Searching.22.29-3|<span class="mw-reflink-text">[3]</span>]][[Search algorithm#cite note-FOOTNOTEKnuth1998.C2.A76.1 .28.22Sequential Searching.22.29-3|<span class="mw-reflink-text">[3]</span>]][[#cite_note-FOOTNOTEKnuth1998.C2.A76.1_(.22Sequential_Searching.22)-4|<span class="mw-reflink-text">^{<nowiki>[4]</nowiki>}</span>]] [[Binary search algorithm|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.{{Sfn|Knuth|1998|loc=§6.2 ("Searching by Comparison of Keys")}} Digital search algorithms work based on the properties of digits in data structures that use numerical keys.{{Sfn|Knuth|1998|loc=§6.3 (Digital Searching)}} Finally, [[Hash table|hashing]] directly maps keys to records based on a [[hash function]].{{Sfn|Knuth|1998|loc=§6.4, (Hashing)}} Searches outside of 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 {{math|''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.