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(2) possible states and/or possible goals.

单词	Dichotomic search
释义	Dichotomic search 英语百科 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(2) possible states and/or possible goals.
随便看	supportive occupational therapy Supportive psychotherapy supportive relationship supportive relationships theory supportive social network supportive subsystem supportive test supportive therapeutic relationship Supportive therapy supportive therapy of leukemia supportive tissue Supportive treatment support jaw support knowledge support large domestic production support large program support lead support ledge support leg supportless support level support lever support lever bracket support life Support line