Source: wikibot/dichotomic-search
= Dichotomic search
{wiki=Dichotomic_search}
Dichotomic search, more commonly known as binary search, is an efficient algorithm for finding a target value within a sorted array or list. The main idea is to repeatedly divide the search interval in half, which significantly reduces the number of comparisons needed compared to linear search methods.