Merge pull request #18 from rbanffy/master

Fix typo

Author: dgrnbrg

doc/hitchhiker.adoc

@@ -13,7 +13,7 @@ Let's look at each of these in some detail.
 You might remember an important theorem from data structures: the best-performing data structure for looking up sorted keys cannot do those queries faster than `O(log(n))`.
 Since sorted trees provide a solution for this, we'll start with them.
 Now, a common sorted tree for this purpose is the Red-Black tree, whose actual query performance is between `log~2~(n)` and `2*log~2~(n)` (the write performance is `log~2~(n)`).
-The factor of 2 comes from the partial imbalances (which are still asymtotically balanced) that the algorithm allows, and the base 2 of the log comes from the fact that it's a binary search tree.
+The factor of 2 comes from the partial imbalances (which are still asymptotically balanced) that the algorithm allows, and the base 2 of the log comes from the fact that it's a binary search tree.
 
 A less popular sorted tree is the AVL tree--this tree achieves `log~2~(n)` query performance, at the cost of always paying `2*log~2~(n)` for inserts.
 We can already see a pattern--although many trees reach the asymptotic bound, they differ in their constant factors.