aboutsummaryrefslogtreecommitdiff
path: root/coreutils/diff.c
diff options
context:
space:
mode:
Diffstat (limited to 'coreutils/diff.c')
-rw-r--r--coreutils/diff.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/coreutils/diff.c b/coreutils/diff.c
index 22c157412..3c409b2cf 100644
--- a/coreutils/diff.c
+++ b/coreutils/diff.c
@@ -820,8 +820,8 @@ static void output(char *file1, FILE * f1, char *file2, FILE * f2)
}
/*
- * The following code uses an algorithm due to Harold Stone,
- * which finds a pair of longest identical subsequences in
+ * The following code uses an algorithm due to Harold Stone,
+ * which finds a pair of longest identical subsequences in
* the two files.
*
* The major goal is to generate the match vector J.