Re:New string search algorithm
by jacobolus on Saturday February 12, 2011 @03:05AM
(#2209638)
The previous Python sort was a type of samplesort, but the current one is a “adaptive, stable, natural mergesort” by Tim Peters (“timsort”). On random data I think it performs about the same or slightly worse, but when data has some structure, it performs much better. See http://bugs.python.org/file4451/timsort.txt
[ Parent
| on HN ]
There are no comments on this comment yet.