CSE331 Lecture 9

CSE331 Lecture 9 - Lecture 9 CSE 331 Sep 19, 2011 6 more to...

Info iconThis preview shows pages 1–14. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 9 CSE 331 Sep 19, 2011
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 more to go… I’ll need confirmation in writing. No graded material will be handed back till I get this signed form from you!
Background image of page 2
Clarification on HW hints Hint points to just one way of solving the problem
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Reading Assignments Sections 1.2, 2.1, 2.2 and 2.4 in [KT]
Background image of page 4
Asymptotic Notation is O with glasses is Ω with glasses = is Θ with glasses
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Run time of an algorithm (Worst-case) run time T(n) for input size n Maximum number of steps taken by the algorithm for any input of size n
Background image of page 6
g(n) is O(f(n)) g(n) n 0 c*f(n) for some c>0 n
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
g(n) is Ω(f(n)) g(n) n 1 n ε*f(n) for some ε>0
Background image of page 8
g(n) is Θ(f(n)) g(n) is O(f(n)) AND g(n) is Ω(f(n)) g(n) n 0 c*f(n) for some c>0 n ε*f(n) for some ε>0 n 1
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
For the find algo from last lecture T(n) is Θ(n)
Background image of page 10
Questions?
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Today’s agenda Analyzing the running time of the GS algo
Background image of page 12
Gale-Shapley Algorithm 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
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 14
This is the end of the preview. Sign up to access the rest of the 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.

Page1 / 18

CSE331 Lecture 9 - Lecture 9 CSE 331 Sep 19, 2011 6 more to...

This preview shows document pages 1 - 14. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online