GATE | GATE MOCK 2017 | Question 23


Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair a and b such that |a-b| = k , k being a positive integer.

(A) O(n)
(B) O(nlog n)

(C) O(n2)
(D) O(logn)

Answer: (A)

Just maintain two pointers at the start and accordingly increment one of them depending upon whether difference is less than or greater than k.Just a single pass is required so the answer is O(n).

Quiz of this Question

GATE CS Corner    Company Wise Coding Practice

Recommended Posts:

1 Average Difficulty : 1/5.0
Based on 1 vote(s)