From 5409381eb074a4e8163e7672489abc2fc7b1b406 Mon Sep 17 00:00:00 2001 From: Eric Schoffstall Date: Wed, 29 Jan 2014 20:19:51 -0700 Subject: [PATCH] fix grammar mistake --- docs/ref-08-reconciliation.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/ref-08-reconciliation.md b/docs/ref-08-reconciliation.md index 1b3fcab0..0678d42f 100644 --- a/docs/ref-08-reconciliation.md +++ b/docs/ref-08-reconciliation.md @@ -103,7 +103,7 @@ renderB:
secondfirst
=> [replaceAttribute textContent 'second'], [insertNode first] ``` -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(n2). 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. +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(n2). 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. ### Keys