Differences

This shows you the differences between two versions of the page.

--- courses:cs211:winter2012:journals:jeanpaul:chapter_fivesection_i [2012/03/06 16:14] – [Unrolling the Mergesort Recurrence] mugabej
+++ courses:cs211:winter2012:journals:jeanpaul:chapter_fivesection_i [2012/03/06 16:17] – [Substituting into the Mergesort Recurrence] mugabej
@@ Line 59: / Line 59: @@
 >>>>>>>>>>>>>>>>>>>>>> = (cn log<sub>2</sub>n) - cn + cn\\
 >>>>>>>>>>>>>>>>>>>>>> = cn log<sub>2</sub>n\\
+>>>>>>>>>>>>>>> This argument establishes the bound T(n) we want, assuming it holds for smaller values m<n, and thus completes our induction proof.\\
+\\
+** An Approach Using Partial Substitution**:\\