Zum Hauptinhalt
Website-Übersicht
DL 1
Startseite
More
Deutsch (de)
Čeština (cs)
Deutsch (de)
English (en)
Français (fr)
Русский (ru)
Sie sind als Gast angemeldet
Login
DL 1
Startseite
Alle aufklappen
Alle einklappen
Open course index
Algorithms and Datastructures I English
Sorting
Sorting
Section outline
◄
Divide and Conquer
►
Dynamic programming
Select activity Recorded lecture (second half)
Recorded lecture (second half)
Link/URL
Abschluss
Students must
Mark as done
Select activity Slides (second half: QuickSort, lower bound on sorting, sorting in linear time)
Slides (second half: QuickSort, lower bound on sorting, sorting in linear time)
Datei
Abschluss
Students must
Mark as done
Select activity Problems (for practicals)
Problems (for practicals)
Textseite
Abschluss
Students must
Mark as done
◄
Divide and Conquer
Direkt zu:
Kursübersicht
Model of comptuation, time and space complexity
Graph search algorithms (BFS and DFS)
Shortest paths in valued graphs
Minimum spanning trees
Union-find
Data-structures for sets
Hash tables
Divide and Conquer
Dynamic programming
Last homework
►
Dynamic programming