Skip to main content
Side panel
DL 1
Home
Calendar
Support
User support
GDPR
More
English (en)
Čeština (cs)
Deutsch (de)
English (en)
Français (fr)
Русский (ru)
You are currently using guest access
Log in
DL 1
Home
Calendar
Support
Collapse
Expand
User support
GDPR
Expand all
Collapse all
Open course index
Faculty of Mathematics and Physics
Department of Applied Mathematics
Algorithms and Datastructures I English
Sorting
Sorting
Section outline
◄
Divide and Conquer
►
Dynamic programming
Select activity Recorded lecture (second half)
Recorded lecture (second half)
URL
Completion
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)
File
Completion
Students must
Mark as done
Select activity Problems (for practicals)
Problems (for practicals)
Page
Completion
Students must
Mark as done
◄
Divide and Conquer
Jump to...
Main course page
General
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
Sorting
Dynamic programming
Last homework
►
Dynamic programming