A RetroSearch Logo

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

Search Query:

Showing content from http://mail.python.org/pipermail/python-dev/2010-September/103533.html below:

[Python-Dev] Behaviour of max() and min() with equal keys

[Python-Dev] Behaviour of max() and min() with equal keys [Python-Dev] Behaviour of max() and min() with equal keysMark Dickinson dickinsm at gmail.com
Tue Sep 7 23:54:27 CEST 2010
On Tue, Sep 7, 2010 at 10:40 PM, Jeffrey Yasskin <jyasskin at gmail.com> wrote:
> Decimal may actually have this backwards. The idea would be that
> min(*lst) == sorted(lst)[0], and max(*lst) == sorted(lst)[-1]. Given a
> stable sort, then, max of equivalent elements would return the last
> element, and min the first.

Yes, you're right; that would make more sense than the other way around.

Mark
More information about the Python-Dev mailing list

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