Circular buffers reuse fixed space.
Build a fixed-size queue whose indexes wrap around, reusing old space without shifting data.
“For the Things Worth Remembering.”
Life, in frames.
View galleryRecent notes.
View all postsCircular buffers reuse fixed space.
Build a fixed-size queue whose indexes wrap around, reusing old space without shifting data.
Read episodeQueues serve the oldest work first.
Use queues for fair first-in-first-out work and deques when both ends need efficient access.
Read episodeMonotonic stacks remove weaker candidates.
Keep a stack in increasing or decreasing order to find the next greater or smaller value efficiently.
Read episode