Information Processing Letters,
16(2), 26 February 1983, pp.61-65
Department of Computer Science,
University of Western Australia,
Received 9 August 1982;
revised 12 November 1982
The stable marriage problem is an appealing version of many pairing problems.
A solution by coroutines is given, based on the recursive algorithm of
McVitie and Wilson (1971). There are few published algorithms where
coroutines are really useful but they solve this problem very naturally.