aboutsummaryrefslogtreecommitdiff
path: root/challenge-086/abigail/c
diff options
context:
space:
mode:
authorAbigail <abigail@abigail.be>2020-11-12 13:15:50 +0100
committerAbigail <abigail@abigail.be>2020-11-12 13:15:50 +0100
commitf4e7f2b554d33cd81368883e81302d5554bd0787 (patch)
tree1becb99e979a20e74801c34d885f73ad0cd63940 /challenge-086/abigail/c
parented17463ccf18b81a6f72296af43b173232c3049d (diff)
downloadperlweeklychallenge-club-f4e7f2b554d33cd81368883e81302d5554bd0787.tar.gz
perlweeklychallenge-club-f4e7f2b554d33cd81368883e81302d5554bd0787.tar.bz2
perlweeklychallenge-club-f4e7f2b554d33cd81368883e81302d5554bd0787.zip
Typo fix in comment
Diffstat (limited to 'challenge-086/abigail/c')
-rw-r--r--challenge-086/abigail/c/ch-1.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/challenge-086/abigail/c/ch-1.c b/challenge-086/abigail/c/ch-1.c
index ba8ed1beda..611816267b 100644
--- a/challenge-086/abigail/c/ch-1.c
+++ b/challenge-086/abigail/c/ch-1.c
@@ -31,7 +31,7 @@ int cmp (const void * a, const void * b) {
/*
* Binary search: return true if target is in array,
- * with index i, min < i < max.
+ * with index i, min <= i < max.
*/
bool bin_search (long * array, long target, size_t min, size_t max) {
size_t mid = (min + max) / 2; /* In C, dividing integers yields an *