• DocumentCode
    1285125
  • Title

    A perspective on Quicksort

  • Author

    Jaja, Joseph

  • Author_Institution
    Inst. for Adv. Comput. Studies, Maryland Univ., College Park, MD, USA
  • Volume
    2
  • Issue
    1
  • fYear
    2000
  • Firstpage
    43
  • Lastpage
    49
  • Abstract
    This article introduces the basic Quicksort algorithm and gives a flavor of the richness of its complexity analysis. The author also provides a glimpse of some of its generalizations to parallel algorithms and computational geometry
  • Keywords
    computational complexity; computational geometry; parallel algorithms; sorting; Quicksort algorithm; complexity analysis; computational geometry; parallel algorithms; Algorithm design and analysis; Application software; Computational geometry; Computer science; Parallel algorithms; Parallel machines; Partitioning algorithms; Sorting;
  • fLanguage
    English
  • Journal_Title
    Computing in Science & Engineering
  • Publisher
    ieee
  • ISSN
    1521-9615
  • Type

    jour

  • DOI
    10.1109/5992.814657
  • Filename
    814657
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1285125