Is it possible to find two numbers whose difference is minimum in O(n) time

Question

Given an unsorted integer array, and without making any assumptions on the numbers in the array:
Is it possible to find two numbers whose difference is minimum i

Answer 1

No, not without making assumptions about the numbers/ordering.

It would be possible given a sorted list though.