Lecture04 - Announcements CSE 421 Algorithms Richard...

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

View Full Document Right Arrow Icon
1 CSE 421 Algorithms Richard Anderson Lecture 4 Announcements • Homework 2, Due October 11, 1:30 pm. • Reading – Chapter 2.1, 2.2 – Chapter 3 (Mostly review) – Start on Chapter 4 Today • Finish discussion of asymptotics – O, , Θ • Graph theory terminology • Basic graph algorithms Formalizing growth rates • T(n) is O(f(n)) [T : Z + Æ R + ] – If sufficiently large n, T(n) is bounded by a constant multiple of f(n) – Exist c, n 0 , such that for n > n 0 , T(n) < c f(n) • T(n) is O(f(n)) will be written as: T(n) = O(f(n)) – Be careful with this notation Order the following functions in increasing order by their growth rate a) n log 4 n b) 2n 2 + 10n c) 2 n/100 d) 1000n + log 8 n e) n 100 f) 3 n g) 1000 log 10 n h) n 1/2 Ordering growth rates • For b > 0 and x > 0 –log b n is O(n x ) • For r > 1 and d > 0 –n d is O(r n )
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Lower bounds • T(n) is (f(n)) – T(n) is at least a constant multiple of f(n) – There exists an n 0 , and ε > 0 such that T(n) >
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/25/2012 for the course CSE 421 taught by Professor Richardanderson during the Fall '06 term at University of Washington.

Page1 / 3

Lecture04 - Announcements CSE 421 Algorithms Richard...

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

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