[+] Divide and Conquer |
In this lecture we study various examples for divide and conquer algorithms. We recall the master theorem for bounding recurrence relations. |
Download Video: 720p |
Lecture notes, page 1/105 •
[previous page] •
[next page] •
[PDF]
Lecture notes, page 1/105 • [previous page] • [next page] • [PDF] |
The video above should play if your web browser supports either modern Flash or HTML5 video with H.264 or WebM codec. The lecture notes should advance automatically. If you have any trouble with playback, email me.