Open In App

GATE | GATE-CS-2015 (Mock Test) | Question 10

Like Article
Like
Save
Share
Report

Given an array that represents elements of arithmetic progression in order. It is also given that one element is missing in the progression, the worst case time complexity to find the missing element efficiently is:
(A) Θ(n)
(B) Θ(nLogn)
(C) Θ(Logn)
(D) Θ(1)


Answer: (C)

Explanation: We can use Binary Search to find the missing element. See following link for details.

https://www.geeksforgeeks.org/find-missing-number-arithmetic-progression/


Quiz of this Question


Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads