--- a/jdk/src/share/classes/java/util/ComparableTimSort.java	Fri Mar 25 18:26:19 2011 -0700
+++ b/jdk/src/share/classes/java/util/ComparableTimSort.java	Fri Mar 25 18:47:57 2011 -0700
@@ -241,7 +241,7 @@
              * pivot < all in [left, start), so pivot belongs at left.  Note
              * that if there are elements equal to pivot, left points to the
              * first slot after them -- that's why this sort is stable.
-             * Slide elements over to make room to make room for pivot.
+             * Slide elements over to make room for pivot.
              */
             int n = start - left;  // The number of elements to move
             // Switch is just an optimization for arraycopy in default case

--- a/jdk/src/share/classes/java/util/TimSort.java	Fri Mar 25 18:26:19 2011 -0700
+++ b/jdk/src/share/classes/java/util/TimSort.java	Fri Mar 25 18:47:57 2011 -0700
@@ -274,7 +274,7 @@
              * pivot < all in [left, start), so pivot belongs at left.  Note
              * that if there are elements equal to pivot, left points to the
              * first slot after them -- that's why this sort is stable.
-             * Slide elements over to make room to make room for pivot.
+             * Slide elements over to make room for pivot.
              */
             int n = start - left;  // The number of elements to move
             // Switch is just an optimization for arraycopy in default case