SnakeSort: A Family of Simple Optimal Randomized Sorting Algorithms

David T. Blackston, Abhiram Ranade · 1993

We present a family of exceedingly simple sorting algorithms called Snakesort. Snakesort is a natural generalization of the simple barallel bubble sort algorithm, also known as odd-even transposition sort. Instances of Snakesort can be implemented on any interconnection network so long as it has a Hamiltonian Path.

Read the paper · More papers on PaperTik