This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Lecture 6 CSE 331 Sep 12, 2011 Grading Rubric for HW 1 ≤ n 2 iterations of the while loop Intially all men and women are free While there exists a free woman who can propose Let w be such a woman and m be the best man she has not proposed to w proposes to m If m is free (m,w) get engaged Else (m,w’) are engaged If m prefers w’ to w w remains free Else (m,w) get engaged and w’ is free Output the engaged pairs as the final output Each iteration has one proposal Each iteration has one proposal Each proposal is new Each proposal is new # iterations ≤ # proposals ≤ # pairs (m,w) ≤ n 2 # iterations ≤ # proposals ≤ # pairs (m,w) ≤ n 2 Why do all the formal progress stuff? Notion of proof by progress will be useful later Example of writing a proof idea/ formal proof ≤ n 2 iterations of the while loop Intially all men and women are free While there exists a free woman who can propose Let w be such a woman and m be the best man she has not proposed to w proposes to m If m is free...
View
Full
Document
This note was uploaded on 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.
 Fall '11
 RUDRA

Click to edit the document details