aboutsummaryrefslogtreecommitdiff
path: root/content/post/programming-as-art/index.md
diff options
context:
space:
mode:
authorKumar Damani <me@kumardamani.net>2023-01-05 15:09:31 +0000
committerKumar Damani <me@kumardamani.net>2023-01-05 15:09:31 +0000
commitc072148c83a86e0b4afb3083104ebb724e19b59f (patch)
tree4b7af88264eb7b52370b80ba531cfffd8861883d /content/post/programming-as-art/index.md
parentd2c85f476d05cec7682012c3c4710fab4f46b38a (diff)
typo fix
Diffstat (limited to 'content/post/programming-as-art/index.md')
-rw-r--r--content/post/programming-as-art/index.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/content/post/programming-as-art/index.md b/content/post/programming-as-art/index.md
index 96b1267..c724e68 100644
--- a/content/post/programming-as-art/index.md
+++ b/content/post/programming-as-art/index.md
@@ -39,7 +39,7 @@ Sure enough we saw the answer `5050` in the console.
But then the TA reminds us that we are making our computers **work too hard**.
In other words, the computer needs to do one-hundred ADD instructions in order to make this computation happen.
-What if it the number was a million? How well would our method scale?
+What if the number was a million? How well would our method scale?
Well then it would take a million ADD instructions.
We call this scaling *linearly* with the input size.