Computer Science 373 Analysis of Algorithms
Prof. Steven Skiena
Fall 2016
Homework 2 Sorting
Due Tuesday, October 11, 2016
Each of the problems should be solved on a separate sheet of paper to facilitate grading. Limit
the solution of each problem to one
Computer Science 373 Analysis of Algorithms
Prof. Steven Skiena
Fall 2016
Homework 3 Graph algorithms
Due Thursday October 27, 2016
Each of the problems should be solved on a separate sheet of paper to facilitate grading. Limit
the solution of each proble
CSE 373 Analysis of Algorithms
Date: September 26, 2016
Solution to HW1
Total Points: 100
Steven Skiena
Problem 1
1-17 [5]
Base case: When we have n = 1 vertex, then we have 0 = n 1 edges. [1]
Inductive step: Assume for n = k, we have k 1 edges. To show t