TADM2E 4.1

From Algorithm Wiki
Revision as of 01:28, 17 June 2015 by Mfrw (talk | contribs)
Jump to: navigation, search

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

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