Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons
BibTeX
@MISC{Goodrich_spin-the-bottlesort,
author = {Michael T. Goodrich},
title = {Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study sorting algorithms based on randomized roundrobin comparisons. Specifically, we study Spin-the-bottle sort, where comparisons are unrestricted, and Annealing sort, where comparisons are restricted to a distance bounded by a temperature parameter. Both algorithms are simple, randomized, data-oblivious sorting algorithms, which are useful in privacy-preserving computations, but, as we show, Annealing sort is much more efficient. We show that there is an input permutation that causes Spin-the-bottle sort to require Ω(n 2 log n) expected time in order to succeed, and that in O(n 2 log n) time this algorithm succeeds with high probability for any input. We also show there is an specification of Annealing sort that runs in O(n log n) time and succeeds with very high probability. 1
