Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://mail.python.org/pipermail/python-list/2005-September/296739.html below:

Self reordering list in Python

• Previous message (by thread): Self reordering list in Python
• Next message (by thread): Self reordering list in Python
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

"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)).

• Previous message (by thread): Self reordering list in Python
• Next message (by thread): Self reordering list in Python
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4