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.
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
1Ana Bell
Connections
6The lectures that define it or assume it, and the concepts next to it.