Is timsort general-purpose or Python-specific?
algorithm, python, sorting
Solution
Yes, it makes quite a bit of sense to use timsort outside of CPython, in specific, or Python, in general.
There is currently an effort underway to replace Java's "modified merge sort" with timsort, and the initial results are quite positive.
Problem
Timsort is an adaptive, stable, natural mergesort. It has supernatural performance on many kinds of partially ordered arrays (less than lg(N!) comparisons needed, and as few as N-1), yet as fast as Python's previous highly tuned samplesort hybrid on random arrays. Have you seen timsort used outside of CPython? Does it make sense?