C455 Algorithms Analysis
Dana Vrajitoru
C455/B503 Homework 7
Due date: Wednesday, March 11, 2026.
Loop Analysis
- 5.1.14, detailed basic operation count
- 5.1.16, total number of iterations, complexity
- 5.1.17 total number of iterations, complexity:
- a,
- c,
- d,
- e.
- All of them from pages 193-199 in the paper textbook.
Euclid's Algorithm
Divide and Conquer
- 5.7.7, pages 262-263,
- 5.8.1 (*A3), page 274,
- 5.8.2, page 274.
Binary Trees
- 5.3.3,
- 5.3.4,
- 5.3.5,
- 5.3.9,
all of them on pages 216-217 in the paper textbook.
Binary Trees Traversals
- 5.4.1 :
- a,
- b,
all of them on page 225 in the paper textbook.