diff options
| author | mame <mame@b2dd03c8-39d4-4d8f-98ff-823fe69b080e> | 2012-11-20 11:13:45 +0000 |
|---|---|---|
| committer | mame <mame@b2dd03c8-39d4-4d8f-98ff-823fe69b080e> | 2012-11-20 11:13:45 +0000 |
| commit | 4c37c520e2443097268356d784a1179589d3bad4 (patch) | |
| tree | 5511772663411b62168bcecb464067d41cb97754 /array.c | |
| parent | f1aee6327a8afa5ed048b270772ae0bf054a4d87 (diff) | |
* 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
Diffstat (limited to 'array.c')
| -rw-r--r-- | array.c | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -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 |