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

Showing content from https://mail.python.org/pipermail/python-dev/2002-July/026859.html below:

[Python-Dev] Priority queue (binary heap) python code

• Previous message: [Python-Dev] Sorting
• Next message: [Python-Dev] Re: Priority queue (binary heap) python code
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

Oren Tirosh <oren-py-d@hishome.net>:
>  When I want to sort a list I just use .sort(). I don't care which algorithm
>  is used.

The point in this discussion, though, is that frequently you don't 
need a sorted list. You just need a list which yields all elements in 
order when you pop them.

Heaps are a nice low-overhead implementation of that idea, and 
therefore should be in the standard library.
-- 
Matthias Urlichs

• Previous message: [Python-Dev] Sorting
• Next message: [Python-Dev] Re: Priority queue (binary heap) python code
• 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