NeatSort --一种实用的自适应算法
NeatSort - A practical adaptive algorithm
摘要:
我们提出了一种新的自适应排序算法,这是最佳的大多数混乱的度量,更重要的是,有一个简单而快速的实现。对于输入$X$,我们的算法具有理论$Ω(|X|)$下限和$\mathcal{O}(|X|\log|X|)$上限,表现出惊人的自适应特性,随着无序(根据不同指标计算)的减少,使其更接近其下限。从实践的角度来看,\textit{NeatSort}已经证明了它与\textit{qsort}和任何\textit{Random Quicksort}实现(甚至在随机阵列上)相比具有竞争力(并且往往更好)。
英文摘要:
We present a new adaptive sorting algorithm which is optimal for most disorder metrics and, more important, has a simple and quick implementation. On input $X$, our algorithm has a theoretical $Ω(|X|)$ lower bound and a $\mathcal{O}(|X|\log|X|)$ upper bound, exhibiting amazing adaptive properties which makes it run closer to its lower bound as disorder (computed on different metrics) diminishes. From a practical point of view, \textit{NeatSort} has proven itself competitive with (and often better than) \textit{qsort} and any \textit{Random Quicksort} implementation, even on random arrays.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。