Computer Science, asked by baidikhan, 4 months ago

what is the time complexity function that find maximum number in a sorted list ​

Answers

Answered by yokeshps2005
0

Answer:

Approach: A simple solution is to traverse the complete array and find maximum. This solution requires O(n) time. We can do it in O(Logn) using Binary

Explanation:

Similar questions