summaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authormo khan <mo@mokhan.ca>2021-10-24 14:20:13 -0600
committermo khan <mo@mokhan.ca>2021-10-24 14:20:13 -0600
commitd1bead476c2e2d112dc606246b1974edf33d2347 (patch)
tree6008353bd61275141eb3c65346776fcd4307ad45 /README.md
parentcff508b47a1cb2eee2da5f748dadeb406861ff28 (diff)
i do not understand asymptotic notation
Diffstat (limited to 'README.md')
-rw-r--r--README.md10
1 files changed, 8 insertions, 2 deletions
diff --git a/README.md b/README.md
index f59fa3f..d4e42d8 100644
--- a/README.md
+++ b/README.md
@@ -123,7 +123,7 @@ When you have completed this objective, you should be able to
For supplemental material, I recommend that you watch this video:
-* [ ] http://freevideolectures.com/Course/1941/Introduction-to-Algorithms/2
+* [X] http://freevideolectures.com/Course/1941/Introduction-to-Algorithms/2
#### Learning Objective 1.3.2 – Standard Notation and Common Functions
@@ -143,7 +143,13 @@ Question to Ponder and Discuss
## Unit 2: Divide-and-Conquer Algorithms
-In the last unit, you learned the concept of divide and conquer. This unit delves further into the divide-and-conquer method. It provides some examples of divide-and-conquer algorithms, including Strassen’s surprising method for multiplying two square matrices. And then, we will study methods for solving recurrences, which are useful for describing the running times of recursive algorithms. One of them, the “master method,” is particularly powerful.
+In the last unit, you learned the concept of divide and conquer.
+This unit delves further into the divide-and-conquer method.
+It provides some examples of divide-and-conquer algorithms,
+including Strassen’s surprising method for multiplying two square matrices.
+And then, we will study methods for solving recurrences,
+which are useful for describing the running times of recursive algorithms.
+One of them, the "master method", is particularly powerful.
For supplemental material, I recommend that you watch this video: