Dichotomic search
id:
dichotomic-search-227-1431976
title:
Dichotomic search
text:
In computer science, a dichotomic search is a search algorithm that operates by selecting between two distinct alternatives 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. This creates a theoretical tradeoff between the number of possible states and the running time: given k comparisons, the algorithm can only r
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Dichotomic_search
date created:
2005-10-28T18:10:02Z
date modified:
2024-09-15T00:13:53Z
main entity:
{"identifier":"Q5272532","url":"https://www.wikidata.org/entity/Q5272532"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/e/e6/Morse_code_tree_side.svg","width":512,"height":1024}
fields total:
13
integrity:
15