--- a/jdk/src/demo/share/jfc/TableExample/TableSorter.java	Fri Dec 12 15:07:00 2014 -0500
+++ b/jdk/src/demo/share/jfc/TableExample/TableSorter.java	Thu Oct 30 07:31:41 2014 -0700
@@ -267,7 +267,7 @@
         than assigned otherwise sister calls in the recursion might
         get out of sinc.  When the number of elements is three they
         are partitioned so that the first set, [low, mid), has one
-        element and and the second, [mid, high), has two. We skip the
+        element and the second, [mid, high), has two. We skip the
         optimisation when the number of elements is three or less as
         the first compare in the normal merge will produce the same
         sequence of steps. This optimisation seems to be worthwhile