Skip to search formSkip to main contentSkip to account menu

Binary search algorithm

Known as: Binary chop, Binary search, Bsearch 
In computer science, binary search, also known as half-interval search or logarithmic search, is a search algorithm that finds the position of a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The miniaturization of dc–dc switch-mode power supplies (SMPS) is of a key importance in volume-sensitive portable devices, such… 
2014
2014
Translator applications that are developed today are mostly doing the translation from national language of one country into… 
2014
2014
Temporal graphs represent vertexes and binary relations that change over time. In this paper we consider a temporal graph as a… 
2013
2013
Design and Analysis of Algorithm is one of the most important areas of Computer Science and Engineering.Searching and Sorting… 
2013
2013
It consider the problem of computing efficient strategies for Searching. As a generalization of the classical binary search for… 
2013
2013
Based on the binary search algorithm,we optimize request way of readers and proposes a new improved algorithm of anti-collision… 
Review
2010
Review
2010
Proposed solutions to a collection of software verification “challenge problems” have been undertaken by a group using Dafny. The… 
2010
2010
The last several years have been characterized by global companies building up massive databases containing computer users… 
2007
2007
Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s…