排序，作为数据上的基础运算，从计算伊始就有着极大的吸引力。虽然当前已有大量的卓越算法，但基于比较的排序算法对Ω(N log N) 比较有着根本的需求，也就是 O(N log N) 时间复杂度。近年来，随着大数据的兴起（甚至万亿字节的数据），效率对数据处理而言愈为重要，研究者们也做了许多努力来提高排序算法的效率...
【Timsort:O(n log n)的超快排序算法】《Timsort — the fastest sorting algorithm you’ve never heard of》by Brandon Skerritt http://t.cn/RrdQ928 pdf:http://t.cn/EAH2vEN
Vergesort is a new sorting algorithm which combines merge operations on almost sorted data, and falls back to another sorting algorithm (pattern-defeating quicksort here, but it could be anything) when the data is not sorted enough. It achieves linear time on some patterns, generally for almost...
So let me just be a little bit more clear about how our previous high level algorithm is going to now be souped up so that the recursive call sort as well. So here's the high level algorithm we proposed before where we just recursively count inversions on the left side, on the right ...
In 1960, C.A.R.Hoare devised the Quick Sort algorithm. After that many people have tried to improve the ability of this algorithm, but they all didn't find a new one. Moreover it was proved that any sorting method which uses comparisons on a array of size n must make at least O(...
in the plane. We begin by sorting them, first by x-coordinate and then by y-coordinate. That takes n log in time. Then we enter the main recursive divide and conquer part of the algorithm. So what do we do? We divide the point set into the ...
Algorithm Partitioning is analogous to sorting an array of 0's and 1's, where elements smaller than the pivot are 0 and elements larger are 1. (Munro et al. 1990) Logsort sorts 0's and 1's stably in O(n) time and O(log n) space via its partition. In brief, Logsort groups 0...
We describe and analyze Zig-zag Sort--a deterministic data-oblivious sorting algorithm running in O(n log n) time that is arguably simpler than previously known algorithms with similar properties, which are based on the AKS sorting network. Because it is data-oblivious and deterministic, Zig-zag...
桶排序假设输入数据服从平均分配,平均情况下代价为O(n)。与计数排序类似,因为对输入数据做了假设,所以其速度也很快。具体来说,计数排序假设输入数据都属于一个小区间内的整数,而桶排序则假设输入数据是由一个随机过程产生,该过程将元素均匀独立分布在[0, 1)(假设的)区间上。桶排序将[0, 1)区间划分为几个相同...
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves We present the first in-place algorithm for sorting an array of size n that performs, in the worst case, at most O(n log n) element comparisons and O(n) el... G Franceschini,V Geffert - IEEE 被引量: 88发表: 200...