Finding the two nearest neighbors in a list of unsorted numbers has a time complexity of

a$.O(n^{\frac{1}{2}})$

b$.O(2n)$

c$.O(logn)$

d$.O(n^2)$