Post Reply 
Programming puzzles: processing lists!
08-16-2017, 03:03 PM
Post: #188
RE: Programming puzzles: processing lists!
(08-16-2017 12:51 PM)pdo Wrote:  Hello,

I don't know if this has been mentioned already for #37, and excuse me if I'm barging in and stating the obvious here, but I think there is a simple proof that the total number of match-day pairings for any even N is equal to (N-1)(N-3)(N-5)...1 and an efficient/elegant way of enumerating them would probably be recursive in nature.

Paul

Well I think it's safe to say that you are neither "barging in" nor "stating the obvious", since neither of the two previously-active participants for this problem seemed to have deduced the equation for the number of "match-days". Smile

I hope you have the time (and inclination) to put something together for this. It would be nice to see how you approach it!
Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread
RE: Programming puzzles: processing lists! - DavidM - 08-16-2017 03:03 PM



User(s) browsing this thread: 4 Guest(s)