Differences

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

--- courses:cs211:winter2012:journals:jeanpaul:chaptersixsectioniii [2012/03/28 02:39] – [Designing the Algorithm] mugabej
+++ courses:cs211:winter2012:journals:jeanpaul:chaptersixsectioniii [2012/03/28 02:39] (current) – [Algorithm Analysis] mugabej
@@ Line 54: / Line 54: @@
 =====  Algorithm Analysis =====
 \\
-The running time of the algorithm is O(n<sup>2</sub>) since filling in the array M[j] takes us O(n) time for each j.\\
+The running time of the algorithm is O(n<sup>2</sup>) since filling in the array M[j] takes us O(n) time for each j.\\
 I give this section 7/10.