Its a problem derived from Stable Marriage Problem, Google it u'll find sol.
On Wed, Aug 3, 2011 at 1:54 PM, MAC <[email protected]> wrote: > Suppose you have N companies visiting your college and your college has N > students . You as placement coordinator knows that each student will get > placed and your college policy is that each student can take ONLY 1 job and > each company can take ONLY 1 student . Each student has told > the placement coordinator his priority . So student A says i will first want > to join ggl, if not i will like to join amz if not adb and so on for > N companies . So each of these N students tell you , > the placement coordinator his preference . Next each company who enters > campus takes a separate exam and ranks the students and says its preference > .So when adb visits campus , adb will say I want student A , if not i want > student F if not i want student G and so on for all N students . So all > these N companies takes separate exam and tells the coordinator its > preference order . So you have N preference lists from companies and > N preference lists from students. > > As a placement coordinator , with all student preferences and with all > company preferences find the best matrix ie which student joins > which company . > -- > thanks > --mac > > -- > 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. > -- Regards Ashish -- 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.
