In computer science, a dichotomic search is a search algorithm that operates by selecting between two distinct alternatives (dichotomies) at each step. It is a specific type of divide and conquer algorithm. A well-known example is binary search. Wikibooks Wikiversity has more about this subject: School of Computer Science Open Directory Project: Computer Science Downloadable Science and Computer Science books Collection of Computer Science Bibliographies Belief that title science in computer science is inappropriate Category: Computer science ... In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. ... In computer science, divide and conquer (D&C) is an important algorithm design paradigm. ... In computer science, binary search or binary chop is a search algorithm for finding a particular value in a linear array, by ruling out half of the data at each step. ...
Abstractly, a dichotomic search can be viewed as following edges of an implicit binary tree structure until it reaches a leaf (a goal or final state). This creates a theoretical tradeoff between the number of possible states and the running time: given k comparisons, the algorithm can only reach O(2k) possible states and/or possible goals. In computer science, a binary tree is a tree data structure in which each node has at most two children. ...
References
Dictionary of Algorithms and Data Structures: Dichotomic search
A binary search algorithm (or binary chop) is a technique for finding a particular value in a linear array, by ruling out half of the data at each step, widely but not exclusively used in computer science.
A binary search is an example of a divide and conquer algorithm (more specifically a decrease and conquer algorithm) and a dichotomicsearch (more at Search algorithm).
The search begins by examining the value in the center of the list; because the values are sorted, it then knows whether the value occurs before or after the center value, and searches through the correct half in the same way.
In computer science, linear search is a search algorithm, also known as sequential search, that is suitable for searching a set of data for a particular value.
A binary search is an example of a divide and conquer algorithm(more specifically a decrease and conquer algorithm) and a dichotomicsearch (more at Search algorithm).
Searching a binary tree for a specific value is a recursive process that we can perform due to the ordering it imposes.
Feeds |
Contact