Two median finder algorithms

Authors:
Firooz Khosraviyani
Affiliations:
Texas A&M International University, Laredo, TX
Venue:
Journal of Computing Sciences in Colleges
Year:
2000

Citing 6
Cited 0

Algorithm 65: find

Communications of the ACM
Fundamentals of Data Structures in Pascal

Fundamentals of Data Structures in Pascal
Data Structures and Algorithms

Data Structures and Algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Time bounds for selection

Journal of Computer and System Sciences
Finding the median

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Availability of material suitable to serve as a basis for a variety of research projects in various areas of computer science education, [8], enriches student learning and advances experimental and theoretical understandings of the field. With this in mind, two non-divide and conquer algorithms based on partitioning are presented. One of these algorithms is among the most efficient median finding algorithms and requires fewer than 3.5n comparisons on the average.