• DocumentCode
    1505718
  • Title

    Quicksort revisited

  • Author

    Davidson, Colin M.

  • Author_Institution
    Philips Telecommun. en Data Syst. Nederland BV, Apeldoorn, Netherlands
  • Volume
    14
  • Issue
    10
  • fYear
    1988
  • fDate
    10/1/1988 12:00:00 AM
  • Firstpage
    1480
  • Lastpage
    1481
  • 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
  • Keywords
    data structures; sorting; External Quicksort; Quicksort; data structures; datatype set; disk control unit; multiprocessor usage; Computer languages; Intelligent control; Milling machines; Sorting; Telecommunications;
  • fLanguage
    English
  • Journal_Title
    Software Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-5589
  • Type

    jour

  • DOI
    10.1109/32.6193
  • Filename
    6193