CS 201: Data Structures (Winter 2018)

HW06: Complexity

Due: Wednesday, 02/07 at 22:00

1. Goals

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

2. Setup

This is a solo written assignment.

3. The assignment

Please see the PDF file.

4. Submission and grading

Submit to Moodle a pdf file.

Grading

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