Chapter 4, Problem 21R

Explanation of Solution

Worst case running time of “find2D” in terms of “n”:

• In “find2D”, an array contains “N” rows and “N” columns.
• An element is searched in that array of “N” rows and “N” columns...

Explanation of Solution

Worst case running time of “find2D” in terms of “N”:

• In “find2D”, the size of an array is “N” size.
• An element is searched in every row of that array...

Explanation of Solution

“Yes”, the “find2D” algorithm is a linear algorithm for seeking any element.

Reasons:

• In each row, the intended element is searched separately...