Samuel W. Bent and John W. John. Finding the median requires 2n comparisons . In this chapter we present a new string matching algorithm with improved bounds on the number of comparisons performed. Finding the median requires 2n comparisons . We are interested in the exact number of comparisons rather then in an asymptotic bound.
Several algorithms solve the string matching problem in linear time.
S. W. Bent and J. W. John. Finding the median requires 2n comparisons . We can generalize comparison trees by allowing more complicated query expressions. Samuel W. Bent and John W. John. Finding the median requires 2n comparisons .