When you implement the Gale-Shapley algorithm in the computer, you have to choos

Question

When you implement the Gale-Shapley algorithm in the computer, you have to choose the man who proposes at each step from among the men who are single. You could put the men in a queue, putting each newly-rejected men at the end of the queue and have him propose when he gets to the front. This gives keeps it fair among the men, since they have to wait for their turns. Which men get penalized if you use a stack instead of a queue? (Consider only how high on their list their final spouse is; disregard any fun they might have in the meantime.)

*need an answer with good explaination*

Explanation / Answer

PSEUDO code:

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.