Can it be done in more or less like merge sort way i.e 1. divide array into half 2. keep on doing it till u have two element left 3. arrang match between two and return winner
On Wed, Apr 7, 2010 at 12:20 PM, «« ÄÑÜJ »» <anujlove...@gmail.com> wrote: > Can any one help me with this problem.... > > > Its a divide and conquer problem where, there are n teams and each > team plays each opponent only once. And each team plays exactly once > every day. If n is the power of 2, I need to construct a timetable > allowing the tournament to finish in n-1 days... > > Any help would be appreciated.. thanks > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- How soon 'not now' becomes 'never'... -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
