Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!feeds.phibee-telecom.net!newsfeed.xs4all.nl!newsfeed2.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail
Return-Path: <drsalists@gmail.com>
X-Original-To: python-list@python.org
Delivered-To: python-list@mail.python.org
X-Spam-Status: OK 0.004
X-Spam-Evidence: '*H*': 0.99; '*S*': 0.00; 'algorithm': 0.04; 'subject:Python': 0.06; 'cc:addr:python-list': 0.11; 'python': 0.11; 'cc:name:python list': 0.16; 'elements).': 0.16; 'heapq': 0.16; 'pypy?': 0.16; 'sorting': 0.16; 'subject: ?': 0.16; 'wrote:': 0.18; 'aug': 0.22; 'cc:addr:python.org': 0.22; 'mon,': 0.24; 'cc:2**0': 0.24; 'header:In-Reply-To:1': 0.27; 'am,': 0.29; 'message-id:@mail.gmail.com': 0.30; 'but': 0.35; 'received:google.com': 0.35; 'to:addr:gmail.com': 0.65; 'default': 0.69; 'partial': 0.84
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :cc:content-type; bh=9ajIAxSDNBXcH2N2bzTOQqduSUjP9q0boUjtLb8jtYo=; b=CqS3ymrpvKBLDwEh7gXVBMTMDTI8HOxPSkkSWelz7TaP3Xrq0hV8GwsOiFmZsTyZqD 3WkTrEFs4UWTc7Ix9SLJtyhl8oDzxb3LcntYeT0dt2PNOh6DE+4AvhB7TPUMwQlhVPpM ls9Xoq7rV1bhTUkDomvp/KmonTP2SwOOlplEm7we2LhWdTNe2X+O4sjwLqtiJBY5auSm DuG+rq6JqlvxUZ8eAAUE49klaIhr2JjD+BIZUDMnVfxFs+IWfguEFTaB84hUQ0WJyTFz WB01ryg2GOlaNdwbGcMIaaImNQ6YmJItaDRRl6TQRlB+T1oMsBg0i4SiRFEaQrjM0z0p MGNA==
MIME-Version: 1.0
X-Received: by 10.180.108.1 with SMTP id hg1mr1770316wib.25.1408398147282; Mon, 18 Aug 2014 14:42:27 -0700 (PDT)
In-Reply-To: <51dfbe9b-f6e0-4532-bc2d-e7ce2fc282b5@googlegroups.com>
References: <51dfbe9b-f6e0-4532-bc2d-e7ce2fc282b5@googlegroups.com>
Date: Mon, 18 Aug 2014 14:42:27 -0700
Subject: Re: efficient partial sort in Python ?
From: Dan Stromberg <drsalists@gmail.com>
To: Chiu Hsiang Hsu <wdv4758h@gmail.com>
Content-Type: text/plain; charset=UTF-8
Cc: Python List <python-list@python.org>
X-BeenThere: python-list@python.org
X-Mailman-Version: 2.1.15
Precedence: list
List-Id: General discussion list for the Python programming language <python-list.python.org>
List-Unsubscribe: <https://mail.python.org/mailman/options/python-list>, <mailto:python-list-request@python.org?subject=unsubscribe>
List-Archive: <http://mail.python.org/pipermail/python-list/>
List-Post: <mailto:python-list@python.org>
List-Help: <mailto:python-list-request@python.org?subject=help>
List-Subscribe: <https://mail.python.org/mailman/listinfo/python-list>, <mailto:python-list-request@python.org?subject=subscribe>
Newsgroups: comp.lang.python
Message-ID: <mailman.13116.1408398154.18130.python-list@python.org>
Lines: 5
NNTP-Posting-Host: 2001:888:2000:d::a6
X-Trace: 1408398154 news.xs4all.nl 2913 [2001:888:2000:d::a6]:56748
X-Complaints-To: abuse@xs4all.nl
Xref: csiph.com comp.lang.python:76518

On Mon, Aug 18, 2014 at 10:18 AM, Chiu Hsiang Hsu <wdv4758h@gmail.com> wrote:
> I know that Python use Timsort as default sorting algorithm and it is efficient,
> but I just wanna have a partial sorting (n-largest/smallest elements).

Perhaps heapq with Pypy?  Or with nuitka?  Or with numba?