- Profs: J. Lengler, D. Steurer
- Website: None but you can use Vorlesungsverzeichnis
- Moodle: Moodle
- Admin: Admin
- Material: Material
- Video: Videos ETHZ
This subject focuses on the design and analysis of algorithms and the organization of data. Students explore common data structures like arrays, lists, stacks, queues, and trees, learning how to choose the appropriate structure based on the problem. The course also emphasizes algorithm efficiency, introducing Big O notation to analyze time and space complexity. And of course while always asking “Geht es besser?” (German for “Can it be better?“) – a common question posed by the professor.
Lecture Notes
- 01 Intro To Algorithms
- 02 Star Search
- 03 Max Subarray Sum
- 04 Searching and Sorting
- 05 Sorting, Data Structures
- 06 Abstract Data Types, Binary AVL Search Trees
- 07 Dynamic Programming, Jump Game, Longest Common Subsequence, Edit Distance
- 08 Subset Sum, Knapsack, Longest Increasing Subsequence
- 09 Graph Theory, Eulerian Cycle Algorithm
- 10 Topological Ordering, Directed Graphs, Representing Graphs on Computers, Topological Sort Algorithm
