This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Quicksort Revisited
October 1988 (vol. 14 no. 10)
pp. 1480-1481

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.

[1] C. A. R. Hoare, "Quicksort,"Comput. J., vol. 5, no. 1, pp. 10-15, 1962.
[2] Wirth, N. 1976.Algorithms + Data Structures = Programs, Englewood Cliffs, NJ, Prentice Hall.
[3] E. W. Dijkstra,A Discipline of Programming. Englewood Cliffs, NJ: Prentice-Hall, 1976.
[4] G. H. Gonnet,A Handbook of Algorithms and Data Structures. Amsterdam, The Netherlands: North-Holland, 1984, pp. 160-162.
[5] H. D. Mills and R. C. Linger, "Data structured programming: Program design without arrays and pointers,"IEEE Trans. Software Eng., vol. SE-12, pp. 192-197, Feb. 1986.

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, Oct. 1988, doi:10.1109/32.6193
Usage of this product signifies your acceptance of the Terms of Use.