h03 : Algorithm Analysis cont., Recursion Chapter 3.4 - 3.7, 5.1 - 5.6
| num | ready? | description | assigned | due |
|---|---|---|---|---|
| h03 | true | Algorithm Analysis cont., Recursion Chapter 3.4 - 3.7, 5.1 - 5.6 | Mon 04/21 08:00AM | Tue 04/29 11:59PM |
Instructions
- Homework assignments will be done online in the Gradescope system: https://www.gradescope.com/courses/1011615/assignments.
- Please pay close attention to the instructions, especially when asking to provide the answer
- Many questions are autograded by the system, which does a character-by-character comparison of the correct answer and your submitted answer.
- Please be PRECISE and EXACT in your solutions in this case, otherwise your answer will not be considered correct.
- You may save your work at any time before the deadline (and I highly encourage this!). You may also resubmit your work any time before the deadline. We will only grade your latest submission.
Complete and submit your answers on Gradescope for H03 based on the textbook reading.
Reading is from Chapters 2.2.2 - 2.3.2, 4.1 - 4.3 of the physical book
- 2.2.2 An Anagram Detection Example
- 2.3 Performance of Python Data Structures
- 4.2 Recursion
- 4.3 Stack Frames: Implementing Recursion or Chapters 3.4 - 3.7, 5.1 - 5.6 of the electronic version.
If you run into any issues or have questions, please don’t hesitate to post on the forum.