Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Browse files

s/,//

  • Loading branch information...
commit 12406e417ecef5588806d9bc01071999bf267b6e 1 parent 2372143
@ekmett authored
Showing with 1 addition and 1 deletion.
  1. +1 −1  README.md
View
2  README.md
@@ -11,7 +11,7 @@ calculate lowest common ancestors in a distributed fashion with good locality.
While algorithms exist that that provide _O(1)_ query time, they all require _O(n)_ preprocessing, where _n_ is
the size of the entire tree, and so are less suitable for LCA search in areas such as revision control where the
-tree is constantly updated, or distributed computing, where the tree may be too large to fit in any one computer's
+tree is constantly updated, or distributed computing where the tree may be too large to fit in any one computer's
memory.
Slides are available as [Purely Functional Data Structures for On-Line LCA](http://www.slideshare.net/ekmett/skewbinary-online-lowest-common-ancestor-search)
Please sign in to comment.
Something went wrong with that request. Please try again.