Gale–Shapley algorithm: Difference between revisions

Content deleted Content added
Fortnow (talk | contribs)
Solution: Added wikipedia links to Gale and Shapley
Clarification of definition of stable matching
Line 12:
}}
 
In other words, a matching is stable when there is no match (''A'', ''B'') where both participants prefer someoneeach elseother to their current partnerpartners.
 
==Solution==