Computer Science, asked by Murtazaphoto8371, 11 months ago

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.

Answers

Answered by nikhilagarwal234
0

Answer:

do this question from net

Similar questions