Binary Search
An efficient search algorithm that finds the position of a target value within a sorted array. It repeatedly divides the search interval in half.
An efficient search algorithm that finds the position of a target value within a sorted array. It repeatedly divides the search interval in half.
Share this glossary:
Share on Facebook Share on Twitter Share via Email Share on LinkedIn Share on Pinterest