CS 321. Algorithm Analysis & Design
Lecture 11
Recursion - Continued.
Fibonacci Numbers
(In class we started with a recap of
Independent Set, see the previous set of slides.)
How many ways to tile a corridor of length n?
How many ways to tile a corridor o

CS 321. Algorithm Analysis & Design
Lecture 6
Divide and Conquer
Closest Pair
Input: A set of n points given in terms of (x,y) coordinates.
Input: A set of n points given in terms of (x,y) coordinates.
Output: The closest pair.
Input: A set of n points gi

CS 321. Algorithm Analysis & Design
Lecture 1
Sorting
Announcements
Announcements
The course website is at http:/cs321.xyz
Announcements
The course website is at http:/cs321.xyz
Please take the informal survey on the website,
or send me an email with the

CS 321. Algorithm Analysis & Design
Lecture 9
Recursion
Satisfiability
The Birthday Problem
The Birthday Problem
CENTRAL EUROPEAN OLYMPIAD IN INFORMATICS
name is a request. This request is satisfied if
and only if John invites name.
name is a request. Thi

Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by Ca