From 275bc2aa3d7d072c4fb7447925b475fa7903b60e Mon Sep 17 00:00:00 2001
From: Zhiyang Lu <103179313+alfaloo@users.noreply.github.com>
Date: Thu, 19 Jun 2025 08:06:01 +0800
Subject: [PATCH] [typo] missing division by block size

---
 content/english/hpc/external-memory/sorting.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/content/english/hpc/external-memory/sorting.md b/content/english/hpc/external-memory/sorting.md
index 299da78f..09fb0728 100644
--- a/content/english/hpc/external-memory/sorting.md
+++ b/content/english/hpc/external-memory/sorting.md
@@ -26,7 +26,7 @@ void merge(int *a, int *b, int *c, int n, int m) {
 }
 ```
 
-In terms of memory operations, we just linearly read all elements of $a$ and $b$ and linearly write all elements of $c$. Since these reads and writes can be buffered, it works in $SCAN(N+M)$ I/O operations.
+In terms of memory operations, we just linearly read all elements of $a$ and $b$ and linearly write all elements of $c$. Since these reads and writes can be buffered, it works in $SCAN((N+M)/B)$ I/O operations.
 
 So far the examples have been simple, and their analysis doesn't differ too much from the RAM model, except that we divide the final answer by the block size $B$. But here is a case where this is not so.