From 4c37c520e2443097268356d784a1179589d3bad4 Mon Sep 17 00:00:00 2001 From: mame Date: Tue, 20 Nov 2012 11:13:45 +0000 Subject: * array.c (rb_ary_bsearch): fix rdoc bug (O(n log n) -> O(log n)). Patch by Charlie Somerville. [ruby-core:49661] [Bug #7409] * range.c (range_bsearch): ditto. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@37755 b2dd03c8-39d4-4d8f-98ff-823fe69b080e --- range.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'range.c') diff --git a/range.c b/range.c index 4c2252f1b3..42fac03599 100644 --- a/range.c +++ b/range.c @@ -475,7 +475,7 @@ range_step(int argc, VALUE *argv, VALUE range) * rng.bsearch {|obj| block } -> value * * By using binary search, finds a value in range which meets the given - * condition in O(n log n) where n is the size of the array. + * 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 -- cgit v1.2.3