Sign inSign in

Comparison model lower bound for search

Searching requires at least log⁡B+1N\log_{B+1} N block reads because each block read of size BB can yield at most log⁡(B+1)\log(B+1) bits of information.
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.

Lecturers

1

    Connections

    4

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

    Concepts3

    Lecture1

    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.