Skip to search formSkip to main contentSkip to account menu

Odd–even sort

Known as: Brick sort, Odd even sort, Odd-even sort 
In computing, an odd–even sort or odd–even transposition sort (also known as brick sort) is a relatively simple sorting algorithm, developed… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Sorting is the fundamental function of any process for most of the application, The widely used hardware sorting algorithm in… 
2018
2018
The odd-even sort algorithm designed by Batcher [1] is a divide-and-conquer parallel sorting algorithm with O(log2(n)) delay time… 
2016
2016
This brief presents an efficient sorting architecture for successive-cancellation-list decoding of polar codes. In order to avoid… 
2016
2016
Owing to the rising demands for resources integration, a lot of research efforts has been devoted to accelerating the data… 
2015
2015
We introduce a sorting scheme which is capable of efficiently sorting encrypted data without the secret key. The technique is… 
2015
2015
We introduce a sorting scheme which is capable of efficiently sorting encrypted data without the secret key. The technique is… 
2012
2012
Sorting is technique by which elements are arranged in a particular order following some characteristic or law [1]. In this paper… 
2009
2009
We adapt merge sort for a single SPU of the Cell Broadband Engine. This adaptation takes advantage of the vector instructions… 
1978
1978
By using anN-loop shift-register structure called a uniform ladder,N records can be sorted by a simplified adaptation of the odd…