O(n log n), unless the point is to annoy my instructor with a needlessly inefficient algorithm, or an O(n log n) algorithm just doesn't exist.I suck at poker, so I choose the other one.
WYR use an algorithm that performs O (n^2) or O (n log n) ?