summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authormo khan <mo@mokhan.ca>2021-09-19 17:38:20 -0600
committermo khan <mo@mokhan.ca>2021-09-19 17:38:20 -0600
commit6b746a478c0c1663216889fd076f4a0b304bec1c (patch)
tree8d023d24b4edc82ff56e66d9f04a5d156ddb589d
parent01cc5021f6fb288a509326cc2fd1f5af04528a50 (diff)
watch lecture video
-rw-r--r--README.md2
-rw-r--r--notes.md9
2 files changed, 9 insertions, 2 deletions
diff --git a/README.md b/README.md
index fd944b1..4f548fe 100644
--- a/README.md
+++ b/README.md
@@ -88,7 +88,7 @@ When you have completed this objective, you should be able to
For supplemental material, I recommend that you watch this video (please ignore the beginning of the video talking about their course information. You can start from 17:20):
-* [ ] http://freevideolectures.com/Course/1941/Introduction-to-Algorithms/1
+* [X] http://freevideolectures.com/Course/1941/Introduction-to-Algorithms/1
#### Learning Objective 1.2.3 – Designing Algorithms
diff --git a/notes.md b/notes.md
index 7e62aae..049f92c 100644
--- a/notes.md
+++ b/notes.md
@@ -509,5 +509,12 @@ the rate of growth in determining computational efficiency for large inputs.
Reduce the input size by rejecting elements or hard code an early return if some condition is satisfied.
+ Check for some particular input and if it receives that then returns some
+ answer. i.e. cheating. Slow algorithm that works fast on some input.
-## 2.3 Designing Algorithms
+[Watch](http://freevideolectures.com/Course/1941/Introduction-to-Algorithms/1)
+
+* Performance
+* User friendliness
+
+Algorithms give you a language to talk about language behaviour.