11 Complexity and Performance

Getting the correct result and having well-structured and documented code are only two aspects of a good program. We also want our code to execute fast and, in some cases, for it to finish running in a moment, hour, day, year, lifetime… This week we more formally discuss algorithmic complexity and performance. In addition to theoretical considerations we look into measuring execution time and benchmarking specific operations.



  • Analysis of function complexity and performance
  • Timing and benchmarking

Assignment 5

  • Data wrangling and computational complexity
  • Due at 11:00 on Monday, 29th November (submission on Blackboard)
  • Rename the file from 05_assignment.ipynb to 05_assignment_studentnumber_firstname_lastname.ipynb before submission