From 1d9a4752f5f78954926642d9ce12a0d2d562fdc3 Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Fri, 21 Feb 2020 17:59:03 +0100
Subject: [PATCH] English: A comma

---
 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 cda9a11..c03d3c5 100644
--- a/05-cache/cache.tex
+++ b/05-cache/cache.tex
@@ -99,7 +99,7 @@ be stored at the same place in the internal memory. This is obviously optimal.
 
 A~cache-aware algorithm can use the same sequence of reads. Generally, we do not know
 the sequence of reads used by the optimal caching strategy, but any specific sequence
-can serve as an upper bound. For example the sequence we used in the I/O model.
+can serve as an upper bound. For example, the sequence we used in the I/O model.
 
 A~cache-oblivious algorithm cannot guarantee that the array will be aligned on
 a~block boundary (it does not know~$B$). In the worst case, this can cost us an extra
-- 
GitLab