Erik Regla

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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.
  • 1