#
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.
Discover the best posts from developers and engineering teams, all in one place.
Join now
→
Learn more
TOPICS
A constant-space linear-time algorithm for deleting all but the 10 most recent files in a directory
1
·
Raymond Chen
·
May 14, 2026, 6:50 p.m.
Old New Thing
Code
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
Old New Thing
Code
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
Howto Find the Start of a Cycle in a Linked List
jsdevspace ·
Jun 3, 2026
algorithms
data-structures
Discover more posts →
AUTHOR
RECENT POSTS FROM THE AUTHOR
Choose how you want to continue.
Continue with GitHub
Continue with Google