Talk:Stable matching problem: Difference between revisions

Content deleted Content added
No edit summary
Line 73:
 
What a spectacularly readable article this is, for a non-mathematician like myself. The algorithm is explained clearly and concisely, in English, without relying entirely on the mysterious-to-the-layman mathemagical runes that normally bedevil even the most trivial of mathematical wiki articles. I feel that encyclopaedic articles should explain a topic to the layman sufficiently well that they could then explain that topic to someone else, without needing to read a dozen other articles to effectively learn a new language first. For me at least, this article fulfils that requirement ''perfectly'', and in my opinion sets a high bar for other articles to reach. [[User:DewiMorgan|DewiMorgan]] ([[User talk:DewiMorgan|talk]]) 12:06, 24 July 2010 (UTC)
 
== The Algorithm Section Seems Incorrect to Me ==
 
Even though it produces the same result, the pseudo-code algorithm is not written the same way as it is described in words. It does not handle "rounds" properly as they were described, as it does not contain the part of the process where "Each woman then considers all her suitors and tells the one she most prefers Maybe and all the rest of them No." According to the algorithm as specified, the woman says yes to every man who proposes, only to dump him if she gets a better offer, and a man receives a "no" answer only by being engaged and subsequently dumped.
 
I do realize that the pseudo-code algorithm produces the same result as the one described in words, but aren't algorithms supposed to be written as described. After all, a different algorithm that produces the same result is still a different algorithm.