From 78a1d5f03a5e2a8ef002aaf02ffe0589321df677 Mon Sep 17 00:00:00 2001 From: Gavin McQuistin Date: Thu, 7 Jan 2016 14:40:44 +0000 Subject: [PATCH] Fix typo in ref-08-reconciliation.md --- 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 8e113d97..a249add2 100644 --- a/docs/ref-08-reconciliation.md +++ b/docs/ref-08-reconciliation.md @@ -13,7 +13,7 @@ React's key design decision is to make the API seem like it re-renders the whole Generating the minimum number of operations to transform one tree into another is a complex and well-studied problem. The [state of the art algorithms](http://grfia.dlsi.ua.es/ml/algorithms/references/editsurvey_bille.pdf) have a complexity in the order of O(n3) where n is the number of nodes in the tree. -This means that displaying 1000 nodes would require in the order of one billion comparisons. This is far too expensive for our use case. To put this number in perspective, CPUs nowadays execute roughly 3 billion instruction per second. So even with the most performant implementation, we wouldn't be able to compute that diff in less than a second. +This means that displaying 1000 nodes would require in the order of one billion comparisons. This is far too expensive for our use case. To put this number in perspective, CPUs nowadays execute roughly 3 billion instructions per second. So even with the most performant implementation, we wouldn't be able to compute that diff in less than a second. Since an optimal algorithm is not tractable, we implement a non-optimal O(n) algorithm using heuristics based on two assumptions: