ConceptTheory & Algos
Ordered file maintenance
The problem of maintaining N items in an array of size O(N) with O(1)-size gaps in a specified order while supporting efficient insertions and deletions.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Erik Demaine
Connections
7The lectures that define it or assume it, and the concepts next to it.