summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authormo khan <mo@mokhan.ca>2021-09-06 20:09:24 -0600
committermo khan <mo@mokhan.ca>2021-09-06 20:09:24 -0600
commitc9c0c297dd52c94668add0e7a0a5f1fb82f8dd66 (patch)
tree4978975468bc5ecef7ed6546a5d740a18fc85761
parent9315dc5fae90d8f6ca28119f0327d69fd82348de (diff)
record discussion post
-rw-r--r--README.md5
-rw-r--r--notes.md22
2 files changed, 16 insertions, 11 deletions
diff --git a/README.md b/README.md
index c8da741..5ebc6e8 100644
--- a/README.md
+++ b/README.md
@@ -52,8 +52,9 @@ When you have completed this objective, you should be able to
#### Discussion Question
-* [ ] Review Problem 1-1 on pages 14–15 of the textbook. How would you go about solving this problem?
-* [ ] Post a response, and comment on other students' responses to earn participation marks and develop your skills as an online communicator in the profession.
+* [X] Review Problem 1-1 on pages 14–15 of the textbook. How would you go about solving this problem?
+* [X] Post a response, and comment on other students' responses to earn participation marks and develop your skills as an online communicator in the profession.
+ * https://scis.lms.athabascau.ca/mod/forum/discuss.php?d=134874#p256921
### Section 1.2: Complexity and Analysis
diff --git a/notes.md b/notes.md
index d92f8ed..b474a52 100644
--- a/notes.md
+++ b/notes.md
@@ -207,15 +207,19 @@ Problem 1-1: Comparison of running times
largest size `n` of a problem that can be solved in time `t`, assuming that
the algorithm to solve the problem takes `f(n)` microseconds.
+ 1 second = 1,000,000 microseconds
+ 1 minute = 60 seconds = 60,000,000 microseconds
+ 1 hour = 60 minutes = 3600 seconds = 3,600,000,000 microseconds
+ 1 day = 24 hours = 1440 mins = 86400 seconds = 86,400,000,000 microseconds
```plaintext
- | | 1 second | 1 minute | 1 hour | 1 day |
- | lg n | | | | |
- | sqrt(n) | | | | |
- | n | | | | |
- | nlg(n) | | | | |
- | n^2 | | | | |
- | n^3 | | | | |
- | 2^n | | | | |
- | n! | | | | |
+ | | 1 second | 1 minute | 1 hour | 1 day |
+ | lg n | 2^(10^6) | 2^(60*10^6) | 2^(3600*10^6) | 2^(86400*10^6) |
+ | sqrt(n) | | | | |
+ | n | 10^6 | 60*10^6 | 3600*10^6 | 86400*10^6 |
+ | nlg(n) | | | | |
+ | n^2 | | | | |
+ | n^3 | | | | |
+ | 2^n | | | | |
+ | n! | | | | |
```