Given a set, P, of n teams in some sport, a round-robin tournament is a col- lection of games in which each team plays each other team exactly once. Such round-robin tournaments are often used as the first round for establishing the order of teams (and their seedings) for later single- or double-elimination tourna- ments. Design an efficient algorithm for constructing a round-robin tournament for a set, P, of n teams assuming n is a power of 2