MadeEasy Test Series 2018: Algorithms - Time Complexity

Question

What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers?

a) O(logn)

b) O(nlogn)

c) O(n^2)

d) O(n^2logn)

Comments

Use merge sort for sorting. In worst case O(nlogn) & O(nlogn) to find x-y = k.

---

But what is the need to sort if Worst Case Time complexity is asked?

---

Worst case of best algo?