fix grammar mistake
Eric Schoffstall committed
Jan 29, 2014 at 20:19 UTC
cf1089fa0e344206eb9c1501f055178812285408
1 file changed
+1
-1
docs/docs/ref-08-reconciliation.md
+1
-1
@@ -103,7 +103,7 @@ renderB: <div><span>second</span><span>first</span></div>
103
=> [replaceAttribute textContent 'second'], [insertNode <span>first</span>]
104
```
105
106
-There are many algorithms that attempt to find the minimum sets of operations to transform a list of elements. [Levenshtein distance](http://en.wikipedia.org/wiki/Levenshtein_distance) can find the minimum using single element insertion, deletion and substitution in O(n<sup>2</sup>). Even if we were to use Levenshtein, this doesn't find when a node has moved into another position and algorithms to do that have a much worst complexity.
106
+There are many algorithms that attempt to find the minimum sets of operations to transform a list of elements. [Levenshtein distance](http://en.wikipedia.org/wiki/Levenshtein_distance) can find the minimum using single element insertion, deletion and substitution in O(n<sup>2</sup>). Even if we were to use Levenshtein, this doesn't find when a node has moved into another position and algorithms to do that have much worse complexity.
107
108
### Keys
109