This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Homework #1 Due Date: Wednesday, September 15th, start of class As a reminder, to have this homework graded, you must first turn in the Academic Honesty Agreement! 1. There is a software engineering class with 3 n students, comprised of n students who are experienced with computer graphics, n students who are experienced with algorithms, and n students who are experienced with programming languages. The project for the course has students working in groups of 3, with each group having a student from each category. Each student has a preference list of who they wish to be matched with. A matching is unstable if there are two groups ( A,B,C ) and ( D,E,F ), for which A and B prefer F to C , and F prefers A to D and B to E . Design an algorithm which produces a stable matching and prove its correctness, or prove that no such algorithm is possible. 2. Order the following functions in order from smallest asymptotic running time to greatest....
View Full Document