In computer science, merge sort (also commonly spelled as mergesort and as merge-sort) is an efficient, general-purpose, and comparison-based sorting...

time, where n = |xs|. *) fun mergesort cmp [] = [] | mergesort cmp [x] = [x] | mergesort cmp xs = (merge cmp o ap (mergesort cmp) o split) xs Quicksort...

Bitonic mergesort is a parallel algorithm for sorting. It is also used as a construction method for building a sorting network. The algorithm was devised...

Batcher's odd–even mergesort is a generic construction devised by Ken Batcher for sorting networks of size O(n (log n)2) and depth O((log n)2), where...

runs instead of merging fixed size sub-lists (as done by traditional mergesort) is that it decreases the total number of comparisons needed to sort the...

n log ⁡ ( n ) ) {\displaystyle O(n\log(n))} sort such as heapsort or mergesort to sort all n points, a popular practice is to sort a fixed number of...

A related but more efficient sort algorithm is the Batcher odd–even mergesort, using compare–exchange operations and perfect-shuffle operations. Batcher's...

network has the same size (number of comparators) and depth as the odd–even mergesort network. At the time of publication, the network was one of several known...

merge sort, defined using the higher-order function until: mergesortBy less [] = [] mergesortBy less xs = head $ until (null . tail) (pairwise $ mergeBy...

fork–join algorithm. mergesort(A, lo, hi): if lo < hi: // at least one element of input mid = ⌊lo + (hi - lo) / 2⌋ fork mergesort(A, lo, mid) // process...

discovered two parallel sorting algorithms: the odd-even mergesort and the bitonic mergesort". He is also a discoverer of scrambling data method in a...

Algorithms". Retrieved 16 March 2017. "[JDK-6804124] (coll) Replace "modified mergesort" in java.util.Arrays.sort with timsort - Java Bug System". bugs.openjdk...

n-way mergesort algorithm also begins by distributing the list into n sublists and sorting each one; however, the sublists created by mergesort have overlapping...

n\log ^{2}n} log ⁡ n {\displaystyle \log n} Yes Yes Merging Variation of Mergesort which uses an O ( n log ⁡ n ) {\displaystyle O(n\log n)} in-place stable...

crossbar switches. Since the 2000s, sorting nets (especially bitonic mergesort) are used by the GPGPU community for constructing sorting algorithms to...

{\displaystyle \Theta (n\log n)} divide-and-conquer algorithms such as mergesort. However, insertion sort or selection sort are both typically faster for...

Funnelsort is a comparison-based sorting algorithm. It is similar to mergesort, but it is a cache-oblivious algorithm, designed for a setting where the...

book}}: |journal= ignored (help) "[JDK-6804124] (coll) Replace "modified mergesort" in java.util.Arrays.sort with timsort - Java Bug System". bugs.openjdk...

Weiß, Armin (7–8 January 2019). Worst-Case Efficient Sorting with QuickMergesort. ALENEX 2019: 21st Workshop on Algorithm Engineering and Experiments....

was proposed by J. Ian Munro and Sebastian Wild. Powersort is a stable mergesort variant that adapts to existing runs in the input data, i.e., ranges in...

TritonSort STXXL, an algorithm toolkit including external mergesort An external mergesort example A K-Way Merge Implementation External-Memory Sorting...

O(log(n)), so that in effect a pipelined version of Batcher's bitonic mergesort and the O(log(n)) PRAM sorts are all O(log2(n)) in terms of clock cycles...

example, to Karatsuba's fast multiplication method, the quicksort and mergesort algorithms, the Strassen algorithm for matrix multiplication, and fast...

those that do not have index, require only sequential access, such as mergesort, and face no penalty. Direct-access storage device Queued sequential access...

bi-directional parity merges A fallback to quadsort, a branchless bi-directional mergesort, significantly increasing adaptivity for ordered inputs Improvements introduced...

2006). "Extra, extra – read all about it: nearly all binary searches and mergesorts are broken". Google Research Blog. Archived from the original on 1 April...

memory. While some divide-and-conquer algorithms such as quicksort and mergesort outperform insertion sort for larger arrays, non-recursive sorting algorithms...

cache-oblivious sorting is possible in two variants: funnelsort, which resembles mergesort; and cache-oblivious distribution sort, which resembles quicksort. Like...

Bloch, "Extra, Extra – Read All About It: Nearly All Binary Searches and Mergesorts are Broken" Archived 2016-04-01 at the Wayback Machine. Official Google...

the aforementioned are specialized partial sorting algorithms based on mergesort and quicksort. In the quicksort variant, there is no need to recursively...