• DocumentCode
    878304
  • Title

    On teaching median-finding algorithms

  • Author

    Gurwitz, Chaya

  • Author_Institution
    Dept. of Comput. & Inf. Sci., Brooklyn Coll., NY, USA
  • Volume
    35
  • Issue
    3
  • fYear
    1992
  • fDate
    8/1/1992 12:00:00 AM
  • Firstpage
    230
  • Lastpage
    232
  • Abstract
    The relationship between quicksort and fast median algorithms is discussed. Both of these algorithms are often taught in the context of an undergraduate analysis of algorithms course, but the relationship between these methods is not usually perceived by the students
  • Keywords
    algorithm theory; computer science education; teaching; computer science; education; median-finding algorithms; quicksort algorithms; students; teaching; undergraduate; Algorithm design and analysis; Education; Information science; Lead; Partitioning algorithms; Sorting; Strips;
  • fLanguage
    English
  • Journal_Title
    Education, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9359
  • Type

    jour

  • DOI
    10.1109/13.144650
  • Filename
    144650
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=878304