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.
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.
Sorted array3Divide and conquer2Linear search2Sorted list2Array1Basic indexing1Control flow1Function1
Opens up
Concepts that name this one as a prerequisite.
Binary search tree3Fractional cascading2Amortized cost1Binary insertion sort1Binary search cache complexity1Binary search for optimization1Binary search on counting complexity1Divide and conquer peak finder (Attempt 1)1Divide and conquer peak finder (Attempt 2)1Interpolation search1Intra-node search1Jump pointers1
Lecturers
6Each in their own terms, from the easiest level.
Ana Bell
An algorithm to search for an element in a sorted list in logarithmic time by repeatedly dividing the search interval in half.Erik Demaine
An algorithm that finds the position of a target value within a sorted array in logarithmic time.Srini Devadas
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.David J. Malan
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
An algorithm that finds the position of a target value within a sorted array by repeatedly dividing the search interval in half.
Lectures that assume it
13The first 12 are shown.
- Geometric Structures I
- Integer Models
- Static Trees
- Algorithmic Thinking & Peak Finding in 1D and 2D
- Data Structures
- Cache-Oblivious Algorithms: Searching & Sorting
- Geometric Structures II
- The Architecture and Bytecode Virtual Machine of SQLite
- Scratch
- B+Tree Indexes
- Recursion Trees and Binary Search Trees (MIT 6.006 Recitation 5)
- Linear Programming: Optimization Reduces to Feasibility
Connections
29The lectures that define it or assume it, and the concepts next to it.
Concepts9
Show 3 moreShow fewer
Lectures20
- Binary Search Trees & Runway Reservation Scheduling
- Insertion Sort, Binary Insertion & Merge Sort Recurrences
- Inventing on Principle
- Sorting Algorithms
- Algorithms
- Big Oh and Theta Notation for Algorithmic Efficiency
Show 14 moreShow fewer
- Instant-Feedback, Instant-Debugging Python Coding
- Geometric Structures I
- Integer Models
- Static Trees
- Algorithmic Thinking & Peak Finding in 1D and 2D
- Data Structures
- Cache-Oblivious Algorithms: Searching & Sorting
- Geometric Structures II
- The Architecture and Bytecode Virtual Machine of SQLite
- Scratch
- B+Tree Indexes
- Recursion Trees and Binary Search Trees (MIT 6.006 Recitation 5)
- Linear Programming: Optimization Reduces to Feasibility
- Valiant–Vazirani Theorem, and Exact Counting (#P)