Due: Wednesday, February 6 at the beginning of class.
From the book: 4.1-4 [page 74]
From the book: 4.2-4 [page 82]
From the book: 4.2-5 [page 82]
From the book: 4.2-7 [page 83]
From the book: 33.1-5 [page 1020]. Do not assume that the input polygon is simple.
Show that Professor Amundsen's algorithm does not correctly tell whether a given polygon is convex by giving a counterexample.
Show how to modify the algorithm so that it always gives the correct answer.
From the book: 33-1(a) [page 1044]. Convex layers.
To within a constant factor, how much time does the following algorithm take, in terms of n?
twoToTheN(n)
if n == 1
return 0
else
return twoToTheN(n-1) + twoToTheN(n-1)
From the book: 30.2-1 [page 914]