From 91f1d53a4e60e35d4a7617b62eab761231cb680d Mon Sep 17 00:00:00 2001 From: Bruce Hill Date: Wed, 11 Sep 2024 15:07:37 -0400 Subject: [PATCH] Update docs --- docs/arrays.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/docs/arrays.md b/docs/arrays.md index 8ec047e..bb5af7c 100644 --- a/docs/arrays.md +++ b/docs/arrays.md @@ -251,7 +251,8 @@ binary_search(arr: [T], by=T.compare) -> Int **Returns:** Assuming the input array is sorted according to the given comparison function, return the index where the given item would be inserted to maintain the sorted -order. +order. That is, if the item is found, return its index, otherwise return the +place where it would be found if it were inserted and the array were sorted. **Example:** ```markdown