summaryrefslogtreecommitdiff
path: root/array.c
diff options
context:
space:
mode:
Diffstat (limited to 'array.c')
-rw-r--r--array.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/array.c b/array.c
index 25fd829aa9..332a7711bd 100644
--- a/array.c
+++ b/array.c
@@ -2378,7 +2378,7 @@ rb_ary_sort(VALUE ary)
* ary.bsearch {|x| block } -> elem
*
* By using binary search, finds a value from this array which meets
- * the given condition in O(n log n) where n is the size of the array.
+ * the given condition in O(log n) where n is the size of the array.
*
* You can use this method in two use cases: a find-minimum mode and
* a find-any mode. In either case, the elements of the array must be