按年被提到
20142016 · 1 次2026
算法与数据结构›经典算法与数据结构·arXiv:1406.1077 · cs.DS

How inefficient can a sort algorithm be?

Miguel A. Lerma · 2014
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2016-06-12 · 最近 2021-10-05
2不同的人
2活跃月份
2讨论串
0被引(OpenAlex)
arXiv 摘要(候选层不写导读)

We find large lower bounds for a certain family of algorithms, and prove that such bounds are limited only by natural computability arguments.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论antognini · 2021-10

“Bogosort is pretty simple, too. while not is_sorted(a) do shuffle(a) However the shuffle function hides a surprising amount of complexity. It is nontrivial to write a correct shuffle function. [1] But Bogosort isn't even the worst sorting algorithm out there! There is also Worstsort [2]. [1]: https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle…”

Is this the simplest (and most surprising) sorting algorithm?原评论 ↗
被提交为 story · 1 次