News for hackers. Stuff that matters.
Re:Tabasco Sort: a super-optimal merge sort by throwaway54-762 on Wednesday August 29, 2012 @03:03PM (#4450436)
How does this compare with e.g. Timsort[0]?

[0]: http://svn.python.org/projects/python/trunk/Objects/listsort...

Re:Tabasco Sort: a super-optimal merge sort by psykotic on Wednesday August 29, 2012 @03:05PM (#4450443)
What makes timsort fast is how it adapts to common patterns in the data (sorted runs, etc). Paul isn't trying to do any of that.