ME-Algothim

Question

Comments

Sort it, return first 2 elements?

---

It is not always that min two elements have least difference

Like 10,2,6,5..after sort 2,5,6,10...here least diff is 1 between pair(5,6)

---

yes, I missed that. So, traverse the array and see adjacent elements each time.

---

But it could be between any pair...not necessaryly adjacent

---

It is asking for minimum. Adjacent is enough .

O(N Log N + N).

Answer 1

Sort the array.

Now do a pass through the array similar to the inner loop of selection sort as follows:

min = 0;
for(int i = 1; i< n-1; i++)
{
    if(diff(A[i], A[i+1]) < diff(A[min], A[min+1]) )
        min = i;
}

Finally A[min], A[min+1] give our required numbers.