The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1988 vol.14)
pp: 1480-1481
ABSTRACT
<p>H.D. Mills and R.C. Linger (1986) propose adding the datatype set to existing programming languages. During some investigations using sets, it became apparent that Quicksort can be written without using stacks (or recursion). Using sets can lead to efficient multiprocessor usage, because if the elements of a set can be processed in any order, they can frequently be processed simultaneously. An example of the possibilities is an intelligent disk control unit based on External Quicksort, using four processors and four read/write heads., The control unit can sort a large disk file in about 1/3 of the time taken by the one-processor version.</p>
INDEX TERMS
data structures; datatype set; Quicksort; multiprocessor usage; disk control unit; External Quicksort; data structures; sorting
CITATION
C.M. Davidson, "Quicksort Revisited", IEEE Transactions on Software Engineering, vol.14, no. 10, pp. 1480-1481, October 1988, doi:10.1109/32.6193
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool