TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Tabasco Sort: a super-optimal merge sort

109 点作者 dduck超过 12 年前

4 条评论

shabble超过 12 年前
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-762超过 12 年前
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 未加载
recursive超过 12 年前
We may have miscalculated what optimal meant in the past, but by definition, it can't be super-optimal.
badusername超过 12 年前
Can we amp up the creativity in naming these things? Coffeescript, Tabasco Sort, Sriracha UI, Bacon Reduce?!