डाइकोटोमिक इसके अंग्रेजी अर्थ का उदाहरण

Computer network security In computer science, a dichotomic search is a search algorithm that operates by selecting between two distinct alternatives (dichotomies) 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).

Some dichotomic searches only have results at the leaves of the tree, such as the Huffman tree used in Huffman coding, 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.

* Thermoflavimicrobium dichotomicum (Krasil'nikov and Agre 1964) Yoon et al.