bunch of updates

[iankelling.org] / blog / 2014-09-29-say-on2.md

diff --git a/blog/2014-09-29-say-on2.md b/blog/2014-09-29-say-on2.md
index 34b769c4dd3d5e5b877a94e3a7e44454af988e92..2853a7935faa1dd9172e1facbe0a60f51bad74e0 100644 (file)
--- a/blog/2014-09-29-say-on2.md
+++ b/blog/2014-09-29-say-on2.md
@@ -163,8 +163,7 @@ def bnf_expand(*args):
 asymtotic = ['asymtotic', '']
 asymtotic_modified = ['bound', 'run time', 'growth', 'growth rate']
 commonly_modified = ['complexity', 'efficiency', 'growth rate']
-common_modifiers = ['computational', 'big oh', 'algorithmic', 'time',
-                     'asymtotic', '']
+common_modifiers = ['computational', 'big oh', 'algorithmic', 'time', 'asymtotic', '']
 unmodified = ['big oh', 'order', 'order of complexity', 'time']
 O = bnf_expand([asymtotic, asymtotic_modified],
                 [common_modifiers, commonly_modified], [unmodified])
@@ -176,7 +175,7 @@ On2 = bnf_expand([O, of, ["n squared"]], [['quadratic'], O],
 print On2
 ~~~
 
-The result is 92 terms which can work the same in a conversation (unless your votes/comments say otherwise). And that doesn't even consider whether to say someting _is_ O(n²), _has_ O(n²), or _is of_ O(n²).
+The result is 92 terms which can work the same in a conversation (unless your votes/comments say otherwise). And that doesn't even consider whether to say something _is_ O(n²), _has_ O(n²), or _is of_ O(n²).
 
 The list is a bit long, so I put them in javascript and made some buttons.