diff options
| author | Kumar Damani <me@kumardamani.net> | 2023-01-05 15:10:54 +0000 |
|---|---|---|
| committer | Kumar Damani <me@kumardamani.net> | 2023-01-05 15:10:54 +0000 |
| commit | 885fea1bd35d17ef4c4d5d75ffc6ac5c4df09e30 (patch) | |
| tree | 462a5988678b9cd4b5ffefc820dce9dd70067943 /public | |
| parent | c072148c83a86e0b4afb3083104ebb724e19b59f (diff) | |
build updates
Diffstat (limited to 'public')
| -rw-r--r-- | public/post/programming-as-art/index.html | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/public/post/programming-as-art/index.html b/public/post/programming-as-art/index.html index 5505e50..7303817 100644 --- a/public/post/programming-as-art/index.html +++ b/public/post/programming-as-art/index.html @@ -72,7 +72,7 @@ sum of 1 to 100. Of course, it was a natural application of what we had just don </span></span></code></pre></div><p>Sure enough we saw the answer <code>5050</code> in the console. But then the TA reminds us that we are making our computers <strong>work too hard</strong>. In other words, the computer needs to do one-hundred ADD instructions in order to make this computation happen.</p> -<p>What if it the number was a million? How well would our method scale?</p> +<p>What if the number was a million? How well would our method scale?</p> <p>Well then it would take a million ADD instructions. We call this scaling <em>linearly</em> with the input size. Later we would formalize this to $\mathcal{O}(n)$ (pronounced: <em>Big Oh of N</em>).</p> |