Worst-case optimal incremental sorting

Worst-case optimal incremental sorting

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...

Full description

Saved in:
Bibliographic Details
Published in:2015 34th International Conference of the Chilean Computer Science Society (SCCC) pp. 1 - 6
Main Authors: Regla, Erik, Paredes, Rodrigo
Format: Conference Proceeding
Language:English
Published: IEEE 01-11-2015
Subjects:
Approximation algorithms
Complexity theory
Electronic mail
Incremental sorting
Introspective algorithms
Partitioning algorithms
Proposals
Sorting
Worst case
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/SCCC.2015.7416566