@DON, For example if in a particular order, the teams appeared as T1, T2, T3, T4 … then team T1 had lost to T2, T2 had lost to T3, and T3 had lost to T4… It may be possible that T3 lost to T1 .. but that need not be taken into consideration while writing the order. Only the neighboring elements should be such that the element on the left has lost to the element on the right.
On Thu, May 23, 2013 at 8:47 PM, Don <dondod...@gmail.com> wrote: > This is not necessarily possible. > > If you have teams A, B, and C, it is possible that > A beat B > B beat C > C beat A. > > Based on the first two games the ranking should be A,B,C. But based on > the third game, C should be ranked higher than A. > > Don > > On May 23, 11:06 am, Nishant Pandey <nishant.bits.me...@gmail.com> > wrote: > > I have a list of N teams T1, T2, T3 … Tn. Each of these teams has played > a > > match against every other team. I have a function displayResult(Team T1, > > Team T2), it returns the team which won the match between any two given > > teams T1 and T2. > > I have to write the teams in an order such the (n-1)th team (in the > order) > > had lost to the nth team which in turn had lost to (n+1)th team. > > > > I want optimize code for this, please help. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to algogeeks+unsubscr...@googlegroups.com. > > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
