Implementation of Near-Optimal Online Multiselection

Indianapolis, IN

Multiselection is the problem of determining the elements of rank r1, r2, ... ,rk of an unsorted array A containing n elements. Barbay et al. proposed an online algorithm to solve the problem using B +o(B)+O(n+q0 log(n)) comparisons. For the project, we implemented the algorithm and recorded the number of comparisons used by the algorithm to verifythe theoretical results of the proposed algorithm.