Lecture about various types of algorithms and their time complexity (follows NTIN060 Algorithms and Data Structures 1). I lead one of the tutorials this semester. For information on obtaining the credit take a look at the page of Martin Koutecký. To submit homeworks, you can enroll into my tutorial on the Postal Owl using the link https://owl.mff.cuni.cz/join/b3dd2ca5a8d7 or the token b3dd2ca5a8d7.
You can find the problem sheets below: