
Two pointers for merging sorted attendance lists
Merge sorted attendance records with two pointers while preserving duplicates and stable ties, then prove linear work and distinguish a merge from set union.
Foundation
The journal / Ideas in progress
Engineering & everyday learningSoftware, systems, and the things I’m learning along the way. From first principles to AI in production.
Find something to readA little theory. A lot of practice.

Merge sorted attendance records with two pointers while preserving duplicates and stable ties, then prove linear work and distinguish a merge from set union.

Use stable merge sort to preserve registration order among equal scores, trace the tie decision, and explain what stability does and does not guarantee.