#
DIFF.BLOG
New
Following
Discover
Jobs
More
Top Writers
Suggest a blog
Upvotes plugin
Report bug
Contact
About
Sign up
The home for great developer writing.
We surface the best developer writing from thousands of independent blogs, updated daily.
Join Diff.blog
TOPICS
A constant-space linear-time algorithm for deleting all but the 10 most recent files in a directory
·
Raymond Chen
·
May 14, 2026, 6:50 p.m.
Code
Old New Thing
algorithms
data-structures
File Management
programming techniques
Summary
This blog post discusses a constant-space linear-time algorithm designed for efficiently deleting all but the ten most recent files in a directory. It emphasizes the use of familiar data structures and techniques to achieve this task.
Read full post on devblogs.microsoft.com →
MORE POSTS LIKE THIS
Non-recursively deleting a binary tree in constant space: Traversal with parent pointers
Raymond Chen ·
Nov 5, 2025
Code
Old New Thing
Zsh: list recently modified files with (m0) glob qualifiers
Adamj ·
Aug 4, 2026
posts
zsh
Production ML-DSA Verification in 350 Lines of Python
Filippo Valsorda ·
Jul 26, 2026
Machine Learning
data-structures
Sorted rank coding
Alisa Sireneva ·
Jul 13, 2026
algorithms
compression
A Theory of Arrays (ToA) Union Find
philzook58 ·
Jul 3, 2026
union-find
data-structures
Mutating a Vec while iterating through it and keeping order
Users Rust Lang ·
Jun 22, 2026
Rust
programming techniques
Discover more posts →
AUTHOR
Sponsored
Zulip
Organized team chat for people who take work seriously. Topic-based threading keeps conversations focused.
Try Zulip
Become a sponsor →
RECENT POSTS FROM THE AUTHOR
Choose how you want to continue.
Continue with GitHub
Continue with Google