Physics, Mathematics & Computer Science

Implementation of Near-Optimal Online Multiselection

James Martin, Butler University

Document Type

Oral Presentation

Location

Indianapolis, IN

Subject Area

Physics, Mathematics & Computer Science

Start Date

11-4-2014 9:30 AM

End Date

11-4-2014 10:30 AM

Description

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.

This document is currently not available here.

Share

COinS
 
Apr 11th, 9:30 AM Apr 11th, 10:30 AM

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.