This is an old revision of the document!


Chapter 5: Divide and Conquer

This chapter will discuss algorithms that break down a given input into different parts and then solves the problem in each part recursively, combining each solution to each part into an overall solution. We will learn how to show and understand these recurrence relations that tell us exactly how that algorithm runs.

5.1: A First Recurrence: The Mergesort Algorithm

This section will discuss Mergesort and the motivations and workings behind it. Mergesort works by dividing

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