Loading [a11y]/accessibility-menu.js
Quicksort revisited | IEEE Journals & Magazine | IEEE Xplore

Quicksort revisited


Abstract:

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 Quicks...Show More

Abstract:

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.<>
Published in: IEEE Transactions on Software Engineering ( Volume: 14, Issue: 10, October 1988)
Page(s): 1480 - 1481
Date of Publication: 31 October 1988

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.