1982•International Journal of Computer MathematicsRequires access

The parallel quicksort algorithm part i–run time analysis

D. J. Evans, Richard C. Dunbar

Abstract

In this paper a general purpose sorting algorithm is produced which is suitable for execution on a parallel computer. The algorithm which is based on Quicksort does not require a fixed number of processors but may theoretically use as many processors as are available. The analysis of the algorithm reveals that there is a maximum number of processors that can be used for a particular size of set Sn

About this research paper

What this paper is about

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Quicksort, Computer science, Sorting algorithm, Algorithm, Parallel computing, Sorting, Set (abstract data type), Execution time