Algorithms and Experimental Complexity (ACE)
A practical first-year (L1 ISTN) course on computational complexity, taught in Java.
Instructor: Thomas Genet
Course overview
This course introduces first-year students (L1 ISTN) to computational complexity, mainly through Java. I taught the practical sessions, where students experiment with a range of basic algorithms to see, firsthand, how an algorithm’s complexity affects its real-world running time.
The course is centered around these hands-on sessions, letting students play with the algorithms directly and build an intuition for what drives their complexity.