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.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications
- Randomized algorithms