Given a list of n integers in any order where there are $2$ of each integer. Design an algorithm that puts matching integers next to each other in the fewest moves possible. The algorithm must be O$($nlogn$),$ the value does not matter so the order they appear does not matter.