Data Structures
Which if the following operation is the easiest in terms of time as a resource ?
An array is not full, The time complexity of Insertion in an array at a specific position is
Finding a number in two-dimensional array
Bill has an algorithm, find2D, to find an element x in an nXn array A. The algorithm find2D iterates over the rows of A & calls the algorithm arrayFind on each row, until x is found or it has reached all rows of A. What is the worst case running time of find2D in terms of n?
Data Structures
Share your Results:
