Bitonic sorters of minimal depth
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 inverted right perpendicularlog(n)inverted left perpendicular - left perpendicularlog(n)right perpendicular. (C) 2011 Elsevier B.V. All rights reserved.
bitonic sorting comparator networks oblivious algorithms symmetric comparator networks