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

Alexandros V. Gerbessiotis, Constantinos J. Siniolakis

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)95-100
Number of pages6
JournalInformation Processing Letters
Volume88
Issue number3
DOIs
StatePublished - Nov 15 2003

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Keywords

  • Randomized algorithms
  • Selection

Fingerprint Dive into the research topics of 'Randomized selection in n + C + o(n) comparisons'. Together they form a unique fingerprint.

Cite this