SnakeSort: A Family of Simple Optimal Randomized Sorting Algorithms

Authors:
David T. Blackston;Abhiram Ranade
Affiliations:
University of California at Berkeley, USA;University of California at Berkeley, USA
Venue:
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 03
Year:
1993

Citing 0
Cited 2

Randomized Shellsort: a simple oblivious sorting algorithm

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.