Output Contest Matches

The bracket matching algorithm pairs the strongest team (rank 1) with the weakest (rank n), second strongest with second weakest, and so on. This greedy pairing is applied recursively: after forming n/2 pairs in round one, these pairs become the new 'teams' for the next round, creating nested parentheses until only one match remains.

This is the smallest possible tournament with only 2 participants. They are directly paired against each other, so the bracket is simply (1,2).

With 16 participants, the tournament creates a more complex nested structure. The pairing follows the pattern where team 1 pairs with team n, team 2 with team n-1, and so on, then these pairs are recursively grouped into larger brackets.