Skip to main content
Side panel
DL 1
Home
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
Support
Collapse
Expand
User support
GDPR
Expand all
Collapse all
Open course index
Algorithms and Datastructures I English
Divide and Conquer
Divide and Conquer
Section outline
Select activity Recorded lecture (second half): Merge sort and Karatsuba algorithm
Recorded lecture (second half): Merge sort and Karatsuba algorithm
URL
Completion
Students must
Mark as done
Select activity Slides (second part): Merge sort; tree of recursion; Karatsuba algorithm
Slides (second part): Merge sort; tree of recursion; Karatsuba algorithm
File
Completion
Students must
Mark as done
Select activity Recorded lecture (Master theorem, Strassen algorithm, Quickselect)
Recorded lecture (Master theorem, Strassen algorithm, Quickselect)
URL
Completion
Students must
Mark as done
Select activity Slides (Master theorem, Strassen algorithm, QuickSelect)
Slides (Master theorem, Strassen algorithm, QuickSelect)
File
Completion
Students must
Mark as done
Select activity Recorded lecture (median of medians)
Recorded lecture (median of medians)
URL
Completion
Students must
Mark as done
Select activity Slides (median of medians)
Slides (median of medians)
File
Completion
Students must
Mark as done
Select activity Poblems on divide and conquer (for practicals)
Poblems on divide and conquer (for practicals)
Page
Completion
Students must
Mark as done
Select activity Homework (Divide & conquer)
Homework (Divide & conquer)
Assignment
Completion
Students must
Mark as done