GATE | GATE CS Mock 2018 | Question 57

Given A, an array of size n, comprised of an increasing sequence of numbers followed immediately by a decreasing one. What is worst case time complexity of optimal algorithm to determine if a given number x is in the array?
(A) Θ(log n)
(B) Θ(n)
(C) Θ(n^2)
(D) Θ(log n)^2


Answer: (A)

Explanation: This is an application of Binary search, which has time complexity Θ(log n) in worst case.
Option (A) is correct.

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.