<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://wiki.karljones.com/index.php?action=history&amp;feed=atom&amp;title=Search_algorithm</id>
		<title>Search algorithm - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://wiki.karljones.com/index.php?action=history&amp;feed=atom&amp;title=Search_algorithm"/>
		<link rel="alternate" type="text/html" href="http://wiki.karljones.com/index.php?title=Search_algorithm&amp;action=history"/>
		<updated>2026-10-23T16:15:49Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.24.2</generator>

	<entry>
		<id>http://wiki.karljones.com/index.php?title=Search_algorithm&amp;diff=17454&amp;oldid=prev</id>
		<title>Karl Jones: Created page with &quot;In computer science, a '''search algorithm''' is an algorithm that retrieves information stored within some data structure.  == Description ==  Data structures...&quot;</title>
		<link rel="alternate" type="text/html" href="http://wiki.karljones.com/index.php?title=Search_algorithm&amp;diff=17454&amp;oldid=prev"/>
				<updated>2016-08-29T17:13:33Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot;In &lt;a href=&quot;/index.php/Computer_science&quot; title=&quot;Computer science&quot;&gt;computer science&lt;/a&gt;, a &amp;#039;&amp;#039;&amp;#039;search algorithm&amp;#039;&amp;#039;&amp;#039; is an &lt;a href=&quot;/index.php/Algorithm&quot; title=&quot;Algorithm&quot;&gt;algorithm&lt;/a&gt; that retrieves &lt;a href=&quot;/index.php/Information&quot; title=&quot;Information&quot;&gt;information&lt;/a&gt; stored within some &lt;a href=&quot;/index.php/Data_structure&quot; title=&quot;Data structure&quot;&gt;data structure&lt;/a&gt;.  == Description ==  Data structures...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In [[computer science]], a '''search algorithm''' is an [[algorithm]] that retrieves [[information]] stored within some [[data structure]].&lt;br /&gt;
&lt;br /&gt;
== Description ==&lt;br /&gt;
&lt;br /&gt;
Data structures can include [[Linked list|linked lists]], [[Array data structure|arrays]], [[Search tree|search trees]], [[Hash table|hash tables]], or various other storage methods.&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
Digital search algorithms work based on the properties of digits in data structures that use numerical keys.&lt;br /&gt;
&lt;br /&gt;
Finally, hashing directly maps keys to records based on a hash function.&lt;br /&gt;
&lt;br /&gt;
Searches outside of a linear search require that the data be sorted in some way.&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
&lt;br /&gt;
* [[Category:Search algorithms]]&lt;br /&gt;
* [[Backward induction]]&lt;br /&gt;
* [[Content-addressable memory hardware]]&lt;br /&gt;
* [[Dual-phase evolution]]&lt;br /&gt;
* [[Linear search problem]]&lt;br /&gt;
* [[No free lunch in search and optimization]]&lt;br /&gt;
* [[Recommender system]]s also use statistical methods to rank results in very large data sets&lt;br /&gt;
* [[Search engine (computing)]]&lt;br /&gt;
* [[Search game]]&lt;br /&gt;
* [[Selection algorithm]]&lt;br /&gt;
* [[Solver]]&lt;br /&gt;
* [[Sorting algorithms]] necessary for executing certain search algorithms&lt;br /&gt;
* Web Searching e.g., Google's [[PageRank]]&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
&lt;br /&gt;
* [https://en.wikipedia.org/wiki/Search_algorithm Search algorithm] @ Wikipedia&lt;br /&gt;
&lt;br /&gt;
[[Category:Computer science]]&lt;/div&gt;</summary>
		<author><name>Karl Jones</name></author>	</entry>

	</feed>