diff options
| author | Elijah Newren <newren@gmail.com> | 2019-11-05 17:07:20 +0000 |
|---|---|---|
| committer | Junio C Hamano <gitster@pobox.com> | 2019-11-07 13:42:00 +0900 |
| commit | 031fd4b93b8182761948aa348565118955f48307 (patch) | |
| tree | 2d4632eff752e87e9e417903584152f50d2d58ae /Documentation/git-range-diff.txt | |
| parent | 566a1439f6f56c2171b8853ddbca0ad3f5098770 (diff) | |
| download | git-031fd4b93b8182761948aa348565118955f48307.tar.gz | |
Documentation: fix a bunch of typos, both old and new
Reported-by: Jens Schleusener <Jens.Schleusener@fossies.org>
Signed-off-by: Elijah Newren <newren@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'Documentation/git-range-diff.txt')
| -rw-r--r-- | Documentation/git-range-diff.txt | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Documentation/git-range-diff.txt b/Documentation/git-range-diff.txt index 8a6ea2c6c5..006feb7ec1 100644 --- a/Documentation/git-range-diff.txt +++ b/Documentation/git-range-diff.txt @@ -242,7 +242,7 @@ corresponding. The overall time needed to compute this algorithm is the time needed to compute n+m commit diffs and then n*m diffs of patches, plus the time -needed to compute the least-cost assigment between n and m diffs. Git +needed to compute the least-cost assignment between n and m diffs. Git uses an implementation of the Jonker-Volgenant algorithm to solve the assignment problem, which has cubic runtime complexity. The matching found in this case will look like this: |