Section: Divide and Conquer | Algorithms and Datastructures I English | DL 1

DL 1

Section outline

- Select activity Recorded lecture (second half): Merge sort and Karatsuba algorithm
  
  Recorded lecture (second half): Merge sort and Karatsuba algorithm URL
  
  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
  
  Students must
  
  Mark as done
- Select activity Recorded lecture (Master theorem, Strassen algorithm, Quickselect)
  
  Recorded lecture (Master theorem, Strassen algorithm, Quickselect) URL
  
  Students must
  
  Mark as done
- Select activity Slides (Master theorem, Strassen algorithm, QuickSelect)
  
  Slides (Master theorem, Strassen algorithm, QuickSelect) File
  
  Students must
  
  Mark as done
- Select activity Recorded lecture (median of medians)
  
  Recorded lecture (median of medians) URL
  
  Students must
  
  Mark as done
- Select activity Slides (median of medians)
  
  Slides (median of medians) File
  
  Students must
  
  Mark as done
- Select activity Poblems on divide and conquer (for practicals)
  
  Poblems on divide and conquer (for practicals) Page
  
  Students must
  
  Mark as done
- Select activity Homework (Divide & conquer)
  
  Homework (Divide & conquer) Assignment
  
  Students must
  
  Mark as done