Abstract
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 language | English (US) |
---|---|
Pages (from-to) | 332-337 |
Number of pages | 6 |
Journal | Journal of Parallel and Distributed Computing |
Volume | 11 |
Issue number | 4 |
DOIs | |
State | Published - Apr 1991 |
Externally published | Yes |
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence