MCQOPTIONS
Saved Bookmarks
| 1. |
What_is_the_time_complexity_of_the_above_iterative_implementation_used_to_find_the_largest_and_smallest_element_in_an_array?$ |
| A. | O(1) |
| B. | O(n) |
| C. | O(n<sup>2</sup>) |
| D. | None of the mentioned |
| Answer» C. O(n<sup>2</sup>) | |