In Jeff's latest blog entry, "Test-Driving a Heap-Based Priority Queue," he shows the incremental code progression for test-driving a priority queue that uses a heap as a backing data structure. Perhaps better suited as a kata (if you're in Java, where there's already a priority queue implementation), the challenge to readers is to find a better derivation.