• DocumentCode
    3752783
  • Title

    Worst-case optimal incremental sorting

  • Author

    Erik Regla;Rodrigo Paredes

  • Author_Institution
    Universidad de Talca Curico, Chile
  • fYear
    2015
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    We present an online algorithm to, given a fixed array A, retrieve its k smallest elements in optimum time for the worst case, that presents fast response in practice. For this, we devise an introspective version of the Incremental Quicksort (IQS) algorithm, which controls the size of the auxiliary stack of the IQS algorithm via an introspective criteria.
  • Keywords
    "Partitioning algorithms","Sorting","Approximation algorithms","Proposals","Complexity theory","Electronic mail"
  • Publisher
    ieee
  • Conference_Titel
    Chilean Computer Science Society (SCCC), 2015 34th International Conference of the
  • Type

    conf

  • DOI
    10.1109/SCCC.2015.7416566
  • Filename
    7416566
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3752783