On Thu, Mar 13, 2008 at 3:16 AM, Dimitrios Apostolou <[EMAIL PROTECTED]> wrote:
>  On another note which sorting algorithm is python using? Perhaps we can
>  add this as a footnote. I always thought it was quicksort, with a worst
>  case of O(n^2).

It's a highly optimized variant of mergesort, with some neat ideas to
make the best-case O(n).

I just made the word "Sort" into a hyperlink, pointing to the link
that Duncan Booth pointed out in another response.

-- 
Daniel Stutzbach, Ph.D.                   President, Stutzbach Enterprises LLC
_______________________________________________
Python-Dev mailing list
Python-Dev@python.org
http://mail.python.org/mailman/listinfo/python-dev
Unsubscribe: 
http://mail.python.org/mailman/options/python-dev/archive%40mail-archive.com

Reply via email to