Parallel quicksort

Bogdan S. Chlebus, Imrich Vrťo

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


A parallel version of quicksort on a CRCW PRAM is developed. The algorithm uses n processors and a linear space to sort n keys in the expected time O(log n) with large probability.

Original languageEnglish (US)
Pages (from-to)332-337
Number of pages6
JournalJournal of Parallel and Distributed Computing
Issue number4
StatePublished - Apr 1991
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence


Dive into the research topics of 'Parallel quicksort'. Together they form a unique fingerprint.

Cite this