Consider there are N players who have a round robin tournament. input is a data structure which says who won the match for every pair <i , j> i != j . write an algo to give a sequence A[1...n] such that for ever i , i th player lost to i+1 th player and won against i-1 th player.
-- Regards, Ramkumar.G -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
