Clear questions and runnable code
get the best and fastest answer
Re^2: Algorithm problem: Order matches by difference between playersby dwm042 (Priest)
|on Apr 18, 2011 at 16:32 UTC||Need Help??|
On odd sizes, if you allow for the person whose "#", so to speak, has turned up to have a 'bye', then I suspect it works pretty well.
In other words, if player 2 in a 7 player tournament has a bye in round 5, player 3 a bye in round 3 and player 4 a bye in round 1, and writing code to allow byes in odd sized tourneys, the same kind of logic as in the even case should fit.
This chart might explain it better: