Courses
recurrence for the runtime must be determined and solved using techniques such as recursion trees or the master theorem. We also learn various techniques such as loop invariants to show the correctness of algorithms [...] trees, heaps, graphs) and standard algorithmic topics (O-notation, sorting, searching, hashing). Master Algorithms and Data Structures (AuD)* Description The lecture "Algorithms and Data Structures" with [...] project Summer 2024 Algorithmic Geometry Lecturer: Kevin Buchin Module: Algorithmische Geometrie (Master INF-MSc-602 (Informatik, Angewandte Informatik)) Type: 2 SWS lecture + 2 SWS exercise Data Structures …
