How can we design an efficient divide-and-conquer algorithm for constructing a round-robin tournament?
Hint. Divide the teams into two sections. Every game that needs to be played is either between two teams in the same section, or between teams in different sections. What is the set of games that must be played between teams in the same section?