comp.lang.python archive
Re: Self reordering list in Python
From: Paul Rubin <//phr.cx@NOSPAM.invalid>
Date: Fri Sep 30 2005 - 12:09:33 CEST
Date: Fri Sep 30 2005 - 12:09:33 CEST
"zooko" <zooko@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)).
Received on Sat Oct 15 03:59:29 2005