diff options
| author | mo khan <mo@mokhan.ca> | 2021-11-07 16:40:19 -0700 |
|---|---|---|
| committer | mo khan <mo@mokhan.ca> | 2021-11-07 16:40:19 -0700 |
| commit | 7515851e37f7476efa71d8552e6872276ddf4ba8 (patch) | |
| tree | 7c047ed430ef16f05cd8fa3e77516e2e4fa6e2aa | |
| parent | 333ac416b98ede79cb6d0c968ebc2de0475f829a (diff) | |
fix alignment
| -rw-r--r-- | 0x01/README.md | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/0x01/README.md b/0x01/README.md index 47bc84b..e0a0016 100644 --- a/0x01/README.md +++ b/0x01/README.md @@ -379,8 +379,8 @@ properties. 1. Exercise 4.4-7 from the textbook (10 marks) Draw the recursion tree for `T(n) = 4T([n/2]) + cn`, where `c` is a constant, - and provide a tight asymptotic bound on its solution. Verify your bound by the - substitution method. + and provide a tight asymptotic bound on its solution. + Verify your bound by the substitution method. `T(n) = 4T(n/2) + cn` |