Sail E0 Webinar
Question
What is the time complexity of the above iterative implementation used to find the largest and smallest element in an array?
Options:
A .  O(1)
B .  O(n)
C .  O(n2)
D .  None of the mentioned
Answer: Option B


The time complexity of the above iterative implementation used to find the largest and the smallest element in an array is O(n).



Was this answer helpful ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

More Questions on This Topic :


Latest Videos

Latest Test Papers