**Miscellaneous Problems, HWK 12**

IST 230

Frank Ritter

2 points total, 10 subpoints total

13/XI/00

(1 points) p. 270-271 # 8, 14.

(1 points) p. 279# 18. p. 280#26,28

(1 point) plot out the types of complexity on p. 275 for N=1 to 100.

(2 points) Find another group. Pick a problem, such searching, sorting, or computing a sum. Find two algorithms to solve that problem, either in the book or from somewhere else. Describe one algorithm per group fully. Then compute its complexity.

(2 points) Distributions 1

(1 point) When people appear to solve the traveling salesman problem they don't solve it in O(2^N) time. Why not? What's going on?

(2 points) section 9.2, p. 309#10, 12, 16, 26