15 Apr
2011
15 Apr
'11
11:15 a.m.
On Friday 15 April 2011 16:42:22, Ben wrote:
hello --
has anyone every implemented (and benchmarked) timsort in haskell?
http://bugs.python.org/file4451/timsort.txt
it is a stable mergesort-like algorithm, seems like a good fit for haskell.
best, ben
From a short look, it seems similar to the algorithm used in Data.List.sort (except for the minrun stuff, which I think is not much of a concern for linked lists).