Data Structures

Fall 2023 ECE 36800 :: Purdue University

Due 9/6



The goals of this assignment are as follows:
  1. You will practice analyzing algorithms and expressing their asymptotic complexity in terms of Big-O.
  2. To help you understand the nature of asymptotic complexity more broadly, you will analyze some algorithms that are not expressed in C code.


Download this document and save on your computer.

You may fill out the form on your computer, or handwrite the answers. If you fill it out on your computer, be sure to save often. If you handwrite, be neat and keep answers within the boxes.

Submit via Gradescope as "HW01". (This will be enabled at least 48 hours before the deadline.)

This assignment requires no programming. You do not need to use eceprog or ececomp.


Answers to questions that arise may be posted here.


Corrections may be noted here.