Randomized selection in n + C + o(n) comparisons

Document Type

Article

Publication Date

11-15-2003

Abstract

A study was conducted on a randomized selection algorithms with high probability. The algorithm was used to determine the Cth order of the n keys for matching a corresponding lower bound on the average number of comparisons required. The result showed that the low order terms in the number of comparisons performed was reduced by the extending the algorithms and analyzing its resulting performance.

Identifier

0141818934 (Scopus)

Publication Title

Information Processing Letters

External Full Text Location

https://doi.org/10.1016/S0020-0190(03)00361-2

ISSN

00200190

First Page

95

Last Page

100

Issue

3

Volume

88

This document is currently not available here.

Share

COinS