Proposal #3271: new methods for Data.Sequence
john at repetae.net
Thu Jul 16 19:53:19 EDT 2009
On Thu, Jul 16, 2009 at 07:48:33PM -0400, Louis Wasserman wrote:
> - I completely rewrote the sorting method. The sort is unstable, but it
> is 40 lines (much more maintainable than the several-hundred line
> implementation from earlier) and runs *twice as fast as* (fromList .
> Data.List.sort . toList) for n=50000. (For sorted lists, it clocks in at
> about 4x faster.)
I think a stable sort is pretty much essential. Can you modify your
better sorting algorithm to be stable? What algorithm is it BTW?
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
More information about the Libraries