Probabilistic integer sorting

Document Type

Article

Publication Date

5-31-2004

Abstract

We introduce a probabilistic sequential algorithm for stable sorting n uniformly distributed keys in an arbitrary range. The algorithm runs in linear time and sorts all but a very small fraction 2-Ω(n) of the input sequences; the best previously known bound was 2 -Ω(n/(lgnlglgn)). An EREW PRAM extension of this sequential algorithm sorts in O((n/p+lgp)lgn/lg(n/p+lgn)) time using p≤n processors under the same probabilistic conditions. For a CRCW PRAM we improve upon the probabilistic bound of 2-Ω(n/(lgnlglgn)) obtained by Rajasekaran and Sen to derive a 2-Ω(nlglgn/lgn) bound. Additionally, we present experimental results for the sequential algorithm that establish the practicality of our method. © 2004 Elsevier B.V. All rights reserved.

Identifier

1842636097 (Scopus)

Publication Title

Information Processing Letters

External Full Text Location

https://doi.org/10.1016/j.ipl.2004.02.007

ISSN

00200190

First Page

187

Last Page

193

Issue

4

Volume

90

Grant

MRI-9977508

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS