The parallel quicksort algorithm part i–run time analysis
David John Evans, Richard C. Dunbar · International Journal of Computer Mathematics · 1982
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