This is an old revision of the document!


Chapter 5 – Divide and Conquer

My notes on the assigned sections of Chapter 5 of Algorithm Design by Jon Kleinberg and Éva Tardos. This chapter details divide and conquer algorithms. A divide and conquer algorithm “breaks the input into several parts, solves the problem in each part recursively, and then combines the solutions” into an overall solution.

5.1 – A First Recurrence: The Mergesort Algorithm

courses/cs211/winter2018/journals/bairdc/chapter5.1520898035.txt.gz · Last modified: by bairdc
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0