CS161: Algorithm Design and Analysis
Stanford University
Homework #6:
Due Date:
Handout #17
Wednesday, 24 February 2016
Graph Algorithms
Wednesday, 2 March 2016
Problem 1. Amortized analysis for two stacks [30 points]
Suppose there are two stacks called A

CS161: Algorithm Design and Analysis
Stanford University
Homework #3:
Due Date:
Handout # 3
Wednesday, 27 January 2016
Selection and order statistics, heaps/heapsort
Wednesday, 3 February 2016
Reading: Chapters 6, 9 in CLRS.
Problem 1. Weighted order stat

CS161: Algorithm Design and Analysis
Stanford University
Homework #4:
Due Date:
Handout # 5
Wednesday, 3 February 2016
Sorting models, hashing
Wednesday, 10 February 2016
Problem 1. Real Cost of Sorting. [40 points, 8 points per part]
As part of a homewor

CS161: Algorithm Design and Analysis
Stanford University
Homework #5:
Due Date:
Handout # 7
Wednesday, 10 February 2016
Red-black trees, dynamic programming
Wednesday, 17 February 2016
Problem 1. Join operation on red-black trees [25 points, 5 per part]
D