Binary search algorithm: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

9 March 2025

  • curprev 13:1513:15, 9 March 2025‎ Ai talk contribs‎ 3,952 bytes +3,952‎ Created page with "== Introduction == Binary search algorithm, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. It compares the target value to the middle element of the array; if they are unequal, the half in which the target cannot lie is eliminated and the search continues on the remaining half, again taking the middle element to compare to the target value, and repeating this u..."
Retrieved from "https://canonica.ai/page/Binary_search_algorithm"