How does this compare with e.g. Timsort[0]? [0]: http://svn.python.org/projects/... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

throwaway54-762 on Aug 29, 2012 | parent | context | favorite | on: Tabasco Sort: a super-optimal merge sort

How does this compare with e.g. Timsort[0]?

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

psykotic on Aug 29, 2012 [–]

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.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact