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
Its a problem derived from Stable Marriage Problem, Google it u'll find sol.
On Wed, Aug 3, 2011 at 1:54 PM, MAC macatad...@gmail.com 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
thanks ashish .
Can you please share links where this is explained clearly . i am unable to
understand the the solutions which i find on google.
llike PROPOSE REJECT ALGORITHM:
suppoose we had the priorities as
stud1:amz-gog-adbe
std2:adbe-goog-amz
std3:goog-adb-amz
and any priorities by