Cache: Typo

05-cache/cache.tex

@@ -166,7 +166,7 @@ reach $\O(N/B \cdot \log N / \log(M/B) + 1)$. This is actually known to be optim
 --- surprisingly, there is a~matching lower bound (FIXME: reference) not only
 for sorting, but for only permuting items.
 
-In the cache-oblivious model, we have is no chance to pick the right number of ways.
+In the cache-oblivious model, we have no chance to pick the right number of ways.
 Still, there exists a~rather complicated algorithm called Funnelsort (FIXME: ref) which
 achieves the same I/O complexity, at least asymptotically. We refer readers to
 the original article.