Difference between revisions of "TADM2E 4.1"
From Algorithm Wiki
(Recovering wiki) |
|||
| Line 1: | Line 1: | ||
Sort it with your favorite nlogn sorting algo. The bottom half is one team, the top half the other. | 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). | ||
Revision as of 01:28, 17 June 2015
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).
