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.
[ Parent
| on HN ]
There are no comments on this comment yet.