3 files changed, 9 insertions, 2 deletions
diff --git a/ChangeLog b/ChangeLog
index 76f37b9750..5e86ba2c50 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,10 @@
+Tue Nov 20 20:10:23 2012  Yusuke Endoh  <mame@tsg.ne.jp>
+
+	* 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.
+
 Tue Nov 20 19:02:44 2012  Koichi Sasada  <ko1@atdot.net>
 
 	* vm_trace.c: rename and add TracePoint APIs.
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
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