Each homework assesses your mastery over the topics covered in the course so far.
Purpose
This homework covers algorithm analysis and design. Specific topics include: asymptotic notation, master theorem, recurrence relations, diviceand-conquer algorithms.
Background
To attempt and submit the homework you will need - to formulate a loop invariant and use it to prove algorithm correctness - knowledge of techniques to solve recurrence relations - understanding of asymptotic notation - comfort with the mathematical tools used in the analysis of algorithms - the ability to interpret a scenario as an algorithmic problem - comfort with GitHub and LaTeX
Task and Submission
Grading
For discussion on the HW, please use the related Canvas discussion thread. viel Spass!
