From 5b02ef32c8f43dd2dc49c5dd6b100a29103cf898 Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Fri, 21 Feb 2020 18:05:55 +0100
Subject: [PATCH] Cache: English
---
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 90ba6c8..339f76e 100644
--- a/05-cache/cache.tex
+++ b/05-cache/cache.tex
@@ -114,7 +114,7 @@ some of the blocks could be already present in the cache.
\subsection{Mergesort}
The traditional choice of algorithm for sorting in external memory is Mergesort. Let us
-analyze it in our models. Merging of two sorted arrays involves three sequential
+analyze it in our models. Merging two sorted arrays involves three sequential
scans: one for each source array, one for the destination array. The scans are
interleaved, but so we can interleave their I/O operations. We need 1~block of
internal memory for each scan, but let us generally assume that $M/B \ge c$
--
GitLab