Sign inSign in
ConceptSystems & CS

Binary search

An algorithm that finds the position of a target value within a sorted array by repeatedly dividing the search interval in half.
as Bret Victor defines itCUSEC ColloquiumThe wording closest to all 7 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

6

Each in their own terms, from the easiest level.

  • Ana Bell

    MIT · Introductory

    An algorithm to search for an element in a sorted list in logarithmic time by repeatedly dividing the search interval in half.
    • 1:28Sorting Algorithms
    • 19:47Big Oh and Theta Notation for Algorithmic Efficiency
  • Erik Demaine

    MIT · Undergraduate

    An algorithm that finds the position of a target value within a sorted array in logarithmic time.
    • 10:34Binary Search Trees & Runway Reservation Scheduling
  • Srini Devadas

    MIT · Undergraduate

    An algorithm that finds the position of a target value within a sorted array in logarithmic time by repeatedly dividing the search interval in half.
    • 5:50Insertion Sort, Binary Insertion & Merge Sort Recurrences
  • David J. Malan

    Harvard University · Undergraduate

    A search algorithm that finds the position of a target value within a sorted array by repeatedly dividing the search interval in half.
  • Robert Lechte

    PyCon AU · Undergraduate

    An algorithm that finds the position of a target value within a sorted array by repeatedly dividing the search interval in half.
    • 10:00Instant-Feedback, Instant-Debugging Python Coding

Lectures that assume it

13

The first 12 are shown.

Connections

29

The lectures that define it or assume it, and the concepts next to it.

6 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.