Difference between pages "4.1" and "5.11"

From The Algorithm Design Manual Solution Wiki
(Difference between pages)
Jump to navigation Jump to search
 
(Created page with " Back to Chapter 5")
 
Line 1: Line 1:
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 5]]
Back to [[Chapter 4]]
 

Latest revision as of 00:56, 21 September 2020


Back to Chapter 5