ConceptTheory & Algos
Binary search cache complexity
Binary search in a sorted array takes T(N) = log N - log B = log N/B memory transfers in the external memory model.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.