Skip to search formSkip to main contentSkip to account menu

Batcher odd–even mergesort

Known as: Odd-even mergesort, Batcher's odd-even merge, Batcher odd-even mergesort 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Array data structureBitonic sorterKen BatcherOdd–even sort

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Dual-pivot and beyond: The potential of multiway partitioning in quicksort
Abstract Since 2011 the Java runtime library uses a Quicksort variant with two pivot elements. For reasons that remained unclear… 
2017
2017
An Efficient Multiway Mergesort for GPU Architectures
Sorting is a primitive operation that is a building block for countless algorithms. As such, it is important to design sorting… 
2016
2016
Library: Numismatic Collection, Nickle Galleries: Odd & Currious Money
2013
2013
VLSI design of parallel sorter based on modified PCM algorithm and Batcher's odd-even mergesort
Data sorting is an important process in digital signal processing. There were many researches related to data sorting, two of… 
2000
2000
The onset of convection in horizontal cylinders
The convective instability of a fluid that fills a horizontal cylindrical cavity is considered. The boundaries of the cavity are… 
1998
1998
Asymptotic expansions of the mergesort recurrences
Abstract. This note provides exact formulae for the mean and variance of the cost of top-down recursive mergesort. These formulae… 
1998
1998
On Batcher's Merge Sorts as Parallel Sorting Algorithms
We examine the average running times of Batcher's bitonic merge and Batcher's odd-even merge when they are used as parallel… 
1997
1997
Efficient oblivious parallel sorting on the MasPar MP-1
The authors address the problem of sorting a large number N of keys on a MarPar MP-1 parallel SIMD machine of moderate size P… 
1989
1989
Performance comparison of distributive and mergesort as external sorting algorithms
1985
1985
The I/O Performance of Multiway Mergesort and Tag Sort
We develop models of secondary storage to evaluate external sorting and use them to analyze the average I/O access time of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)