diff --git a/05-cache/cache.tex b/05-cache/cache.tex
index 6999cd2cd946f887712c6ad3e301b851bbe7c3af..90ba6c831255074b5a35015961ec83b341d2b917 100644
--- a/05-cache/cache.tex
+++ b/05-cache/cache.tex
@@ -95,7 +95,7 @@ read sequentially from the start to the end. This is called an \em{array scan.}
 
 In the I/O model, we can make the array start at a~block boundary. So we need
 to read $\lceil N/B\rceil \le N/B+1$ consecutive blocks to scan all items. All blocks can
-be stored at the same place in the internal memory. This is obviously optimal.
+be stored at the same place in the internal memory. This strategy 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