From The Algorithm Design Manual Solution Wiki
Revision as of 18:20, 20 September 2020 by Algowikiadmin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Sort it with your favorite nlogn sorting algorithm. The bottom half is one team, the top half the other.

Or much better, partition it with median as pivot. Time complexity O(n).

Back to Chapter 4