On Mon, Aug 18, 2014 at 10:18 AM, Chiu Hsiang Hsu <wdv47...@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? -- https://mail.python.org/mailman/listinfo/python-list
