## Algorithm Abstraction and Design Notes

Introduction These notes are on the COP4533 Algorithm Abstraction & Design with Professor Ungor at the University of Florida. What I have learned from this course has been compounded into these notes. Stable Matching Problem Given a set of preferences among hospitals and med-school students, we have to design a self-reinforcing admissions process. A matching $M$ is a set of ordered pairs, $h-s$, where $h \in H$ and $s \in S$, such that: ...