A comparative implementation of the Stable Marriage problem across four programming paradigms, exploring how language design shapes problem-solving approaches.
The implementations use the Gale-Shapley and McVitie-Wilson algorithms
| Paradigm | Language |
|---|---|
| Object-Oriented | Java |
| Concurrent | Go |
| Logic | Prolog |
| Functional | Scheme |
Built as part of CSI2520 (Programming Paradigms) in the Winter of 2026