"zooko" <zooko at zooko.com> writes: > I haven't benchmarked it against Evan Podromou's heap implementation > yet, but obviously inserting and removing things from a heapq heap is > O(N). Good heavens, I should hope not. The whole point of heaps is that those operations are O(log(N)).