From 17300317e184ad5f8abd27cf3c47d30fabdeca43 Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Fri, 21 Feb 2020 18:00:15 +0100
Subject: [PATCH] Cache: Typo

---
 05-cache/cache.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/05-cache/cache.tex b/05-cache/cache.tex
index c03d3c5..6999cd2 100644
--- a/05-cache/cache.tex
+++ b/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.
-- 
GitLab