Simplified odd-even sort using multiple shift-register loops

DOI10.1007/BF00991635zbMath0402.68049OpenAlexW1965148046MaRDI QIDQ4187324

No author found.

Publication date: 1978

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00991635

zbMATH Keywords

Multiple Shift-Register LoopsOdd-Even Transposition-Sort Algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Formal languages and automata (68Q45)

Related Items (2)

A parallel sorting scheme whose basic operation sortsN elements ⋮ A new parallel sorting algorithm based upon min-mid-max operations

Cites Work

• Storage Management Operations in Linked Uniform Shift-Register Loops
• Unnamed Item

This page was built for publication: Simplified odd-even sort using multiple shift-register loops