Thnx guys for the help.. On Apr 7, 7:45 pm, Nikhil Agarwal <nikhil.bhoja...@gmail.com> wrote: > Following are the recurrences: > T(n)=2T(n/2)+1 > T(2)=1 > T(n)=n-1 > =O(n) > 1 is added because winner of both the sides will compete at most 1 once. > > for Time table u can form a tree > > x1 x2 x3 x4 x5 > \ / \ / / > x1 x3 / > \ \ / > \ x5 > \ / > x1 > > Here are four matches and team nos =5 > > 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. > > -- > Thanks & Regards > Nikhil Agarwal > Junior Undergraduate > Computer Science & Engineering, > National Institute Of Technology, Durgapur,Indiahttp://tech-nikk.blogspot.com
-- 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.
