# Lecture13 - Announcements HW 5 available CSE 421 Algorithms...

This preview shows pages 1–2. Sign up to view the full content.

1 CSE 421 Algorithms Richard Anderson Lecture 13 Divide and Conquer Announcements • HW 5 available – Deadline Friday, Nov 3. •M id te rm – Friday, Nov 3. – Material from lecture/text through end of chapter 5 – 50 minutes, in class, closed book/notes, short answer, approximately five problems, problems easier than HW problems. What you really need to know about recurrences • Work per level changes geometrically with the level • Geometrically increasing (x > 1) – The bottom level wins • Geometrically decreasing (x < 1) – The top level wins • Balanced (x = 1) – Equal contribution T(n) = aT(n/b) + n c • Balanced: a = b c • Increasing: a > b c • Decreasing: a < b c Classify the following recurrences (Increasing, Decreasing, Balanced) • T(n) = n + 5T(n/8) • T(n) = n + 9T(n/8) • T(n) = n 2 + 4T(n/2) • T(n) = n 3 + 7T(n/2) • T(n) = n 1/2 + 3T(n/4) Divide and Conquer Algorithms

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 4

Lecture13 - Announcements HW 5 available CSE 421 Algorithms...

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

View Full Document
Ask a homework question - tutors are online