CS 201: Data Structures (Winter 2017)

HW06: Complexity

Due: Friday, 02/03 at 22:00

This is a solo written assignment.

1. Goals

To practice using Big Oh notation to aid in understanding algorithmic complexity.

2. The assignment

Please see the PDF file.

3. Submission and grading

Submit to Moodle a pdf file.

Grading

• Problem 1 [4 points]
• Problems 2–4 [6 points]