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
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.
Step by Step Solution
3.50 Rating (160 Votes )
There are 3 Steps involved in it
Certainly The task is to write a more efficient algorithm for searching a target value in a sorted list The purpose of this algorithm is to improve th... View full answer
Get step-by-step solutions from verified subject matter experts
