$3.$ Can you design a more efficient algorithm than the one based on the brute$-$force strategy to solve the closest$-$pair problem for n points x$1,$ x$2,...,$xn on the real line?

$($Hint: Sorting real numbers can be done in O$($n log n$)$ time.$)$