Question: Bill has an algorithm, find2D, to find an element x in an n n array A. The algorithm find2D iterates over the rows of
Bill has an algorithm, find2D, to find an element x in an n × n array A. The algorithm find2D iterates over the rows of A and calls the algorithm arrayFind, of Algorithm 1.12, on each one, until x is found or it has searched all rows of A. What is the worst-case running time of find2D in terms of n? Is this a linear-time algorithm? Why or why not?
Step by Step Solution
3.46 Rating (166 Votes )
There are 3 Steps involved in it
The worst case running time of find2D is On 2 This is seen b... View full answer
Get step-by-step solutions from verified subject matter experts
