Sign inSign in
ConceptSystems & CS

Bisection search

A divide-and-conquer search algorithm that repeatedly checks the middle element of a sorted list and halves the search space.
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.

Approximation method1Complexity analysis1Endpoint1Feedback mechanism1Floating point number1Interval representation1Ordered search space1Recursion1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Ana Bell

    MIT · Introductory

    • 14:10Bisection Search and Newton-Raphson

Connections

6

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

1 lecturer. 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.