MCQOPTIONS
Saved Bookmarks
| 1. |
What is the time complexity of the above recursive implementation used to find the largest and the smallest element in an array? |
| A. | O(1) |
| B. | O(n) |
| C. | O(n2) |
| D. | O(n3) |
| Answer» C. O(n2) | |