Write an algorithm called SortedSequentialSearch that will return the same results as SequentialSearch but will run more
Fantastic news! We've Found the answer you've been seeking!
Question:
Write an algorithm called SortedSequentialSearch that will return the same results as SequentialSearch but will run more quickly because it can stop with a failure the moment it finds that the target is smaller than the current list value.
When you write your algorithm, use the Compare(x,y) function:
Compare(x,y) = {-1 if x < y , 0 if x = y, 1 if x > y )
Do an analysis of the worst case, average case with the target found. And average case with the target not found.
Related Book For
Mathematical Statistics with Applications in R
ISBN: 978-0124171138
2nd edition
Authors: Chris P. Tsokos, K.M. Ramachandran
Posted Date: