Article,

Sorting in Rounds

.
Discrete Mathematics, 72 (1): 21--28 (1988)
DOI: 10.1016/0012-365X(88)90190-2

Abstract

The main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n then n objects can be sorted in r rounds by asking no more than 2r+1n1+1/r(log n)2-2/r/(log log n)(r-1/r questions in each round.

Tags

Users

  • @ytyoun

Comments and Reviews