Zum Hauptinhalt
Website-Übersicht
DL 1
Startseite
More
Deutsch (de)
Русский (ru)
Čeština (cs)
Deutsch (de)
English (en)
Français (fr)
Sie sind als Gast angemeldet
Login
DL 1
Startseite
Alle aufklappen
Alle einklappen
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
Link/URL
Abschluss
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
Datei
Abschluss
Students must
Mark as done
Select activity Recorded lecture (Master theorem, Strassen algorithm, Quickselect)
Recorded lecture (Master theorem, Strassen algorithm, Quickselect)
Link/URL
Abschluss
Students must
Mark as done
Select activity Slides (Master theorem, Strassen algorithm, QuickSelect)
Slides (Master theorem, Strassen algorithm, QuickSelect)
Datei
Abschluss
Students must
Mark as done
Select activity Recorded lecture (median of medians)
Recorded lecture (median of medians)
Link/URL
Abschluss
Students must
Mark as done
Select activity Slides (median of medians)
Slides (median of medians)
Datei
Abschluss
Students must
Mark as done
Select activity Poblems on divide and conquer (for practicals)
Poblems on divide and conquer (for practicals)
Textseite
Abschluss
Students must
Mark as done
Select activity Homework (Divide & conquer)
Homework (Divide & conquer)
Aufgabe
Abschluss
Students must
Mark as done