Average case analysis of five two-dimensional bubble sorting algorithms
Conference Paper
Overview
Identity
Additional Document Info
Other
View All
Overview
abstract
1993 ACM. For each of five generalizations of the odd-even transposition sort to a sorting algorithm on a VN x t/N mesh of processors, we demonstrate that with "high probability," the number of steps required to sort a random permutation of N numbers is (N).
name of conference
Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures - SPAA '93