<[EMAIL PROTECTED]> wrote in message news:[EMAIL PROTECTED] | Teach said that the optimal threshold in hybrids is 14-16, but guess | he wasn't so right after all =\\ The overhead of using insertion sort | on a longer list turns out to be faster than just piling on | recursions, when confronted with bigger lists.
The current list.sort (is C, of course, not Python) is a hybrid insert/merge sort with a threshhold, last I knew, of 64. I believe there are explanatory comments in the source. tjr -- http://mail.python.org/mailman/listinfo/python-list
