World Library  
Flag as Inappropriate
Email this Article

Dichotomic search

Article Id: WHEBN0003021223
Reproduction Date:

Title: Dichotomic search  
Author: World Heritage Encyclopedia
Language: English
Subject: Binary search algorithm, Location arithmetic, Search algorithms, Morse code, List of terms relating to algorithms and data structures
Publisher: World Heritage Encyclopedia

Dichotomic search

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.

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.

Some dichotomic searches only have results at the leaves of the tree, such as the Huffman tree used in Huffman compression, or the implicit classification tree used in Twenty Questions. Other dichotomic searches also have results in at least some internal nodes of the tree, such as a dichotomic search table for Morse code. There is thus some looseness in the definition. Though there may indeed be only two paths from any node, there are thus three possibilities at each step: choose one onwards path or the other, or stop at this node.

A graphical representation of the dichotomic search table for Morse code. Shifting to the left represents a Dit (.), and a shift to the right represents a Dah (-). Where one lands indicates the letter for the code.
A graphical representation of the dichotomic search table: the user branches left at every dot and right at every dash until the character is finished.
T – M – – O – – – CH – – – –
Ö – – – ·
G – – · Q – – · –
Z – – · ·
N – · K – · – Y – · – –
C – · – ·
D – · · X – · · –
B – · · ·
E · A · – W · – – J · – – –
P · – – ·
R · – · Ä · – · –
L · – · ·
I · · U · · – Ü · · – –
F · · – ·
S · · · V · · · –
H · · · ·

Dichotomic searches are often used in repair manuals, sometimes graphically illustrated with a flowchart similar to a fault tree.


  • Dictionary of Algorithms and Data Structures: Dichotomic search
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.