TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Tabasco Sort: a super-optimal merge sort

109 pointsby dduckover 12 years ago

4 comments

shabbleover 12 years ago
As mentioned in the reddit thread[1], the occasional mentions of 'Python' refer to the SBCL compiler[2] rather than the little-p python language. This confused me for a little while as I tried to figure out how they were running on the python VM.<p>[1] <a href="http://www.reddit.com/r/programming/comments/yy6e4/tabasco_sort_a_superoptimal_merge_sort/" rel="nofollow">http://www.reddit.com/r/programming/comments/yy6e4/tabasco_s...</a><p>[2] <a href="http://insidelisp.blogspot.co.uk/2010/04/book-chapter-11-what-is-python-and-what.html" rel="nofollow">http://insidelisp.blogspot.co.uk/2010/04/book-chapter-11-wha...</a>
throwaway54-762over 12 years ago
How does this compare with e.g. Timsort[0]?<p>[0]: <a href="http://svn.python.org/projects/python/trunk/Objects/listsort.txt" rel="nofollow">http://svn.python.org/projects/python/trunk/Objects/listsort...</a>
评论 #4450443 未加载
recursiveover 12 years ago
We may have miscalculated what optimal meant in the past, but by definition, it can't be super-optimal.
badusernameover 12 years ago
Can we amp up the creativity in naming these things? Coffeescript, Tabasco Sort, Sriracha UI, Bacon Reduce?!