Simplified odd-even sort using multiple shift-register loops

Autor:	Tien Chi Chen, Vincent Y. Lum, Chin Tung, Kapali P. Eswaran
Rok vydání:	1978
Předmět:	Proxmap sort Sorting algorithm Computer science Comparison sort Sorting Odd–even sort Theoretical Computer Science Combinatorics Computational Theory and Mathematics Pigeonhole sort Algorithm Counting sort Software Block sort Information Systems
Zdroj:	International Journal of Computer & Information Sciences. 7:295-314
ISSN:	1573-7640 0091-7036
DOI:	10.1007/bf00991635
Popis:	By using anN-loop shift-register structure called a uniform ladder,N records can be sorted by a simplified adaptation of the odd-even transposition-sort algorithm to finish in (N + 1)/2 loop times (periods) using (N − 1) comparators. The sorting can be overlapped with input/output; the percentage of unoverlapped sorting times is less than 20% of the total time with a single ladder, less than 6% using two ladders, and is zero with a sufficient number of ladders.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::b93758d213238defee25429b8e8cc889 https://doi.org/10.1007/bf00991635 Zobrazit plný text záznamu Full text from SpringerLink