... >> Theory >> Algorithm >> Binary Search
Highest Rated Sign
Nobody has posted a sign yet.
Binary Search

Definition: The idea is to look at the element in the middle. If the key is equal to that, the search is finished. If the key is less than the middle element, do a binary search on the first half. If it's greater, do a binary search of the second half.
Source: Reges & Stepp, 2007

Example: Example sentence for context: "The advantage of a binary search over a linear search is astounding for large numbers." For more information about binary search, see <a href="http://webpages.ull.es/users/jriera/Docencia/AVL/AVL%20tree%20applet.htm"> this</a> website.
 There are no comments for this topic.