CS 263 - Algorithms Homework 1, 50 Points
Due: Wednesday, October 10, 2007
-
10 points.
Problem 3 from Chapter 2 of K-T.
-
10 points.
Problem 6 from Chapter 2 of K-T.
-
10 points.
Problem 8 from Chapter 2 of K-T.
-
10 points.
What is the total running time of counting from 1 to n
in binary if the time needed to add 1 to the current number i is
proportional to the number of bits in the binary expansion of i that
must change?
-
10 points.
Problem 4 from Chapter 3 of K-T.