I'm working on running sequences of heap operations (insert and delete-min) in linear time instead of O(n log n) total time. It's a silly little project in the

I'm working on running sequences of heap operations (insert and delete-min) in linear time instead of O(n log n) total time. It's a silly little project in theoretical computer science I have. Crucially, to make this bound work, you only learn the final state of the heap, not which element got deleted when. I'm also building a simpler soft heap.