1219      * input arrays to n/2 object references for randomly ordered input

  1219      * input arrays to n/2 object references for randomly ordered input

  1220      * arrays.

  1220      * arrays.

  1221      *

  1221      *

  1222      * <p>The implementation takes equal advantage of ascending and

  1222      * <p>The implementation takes equal advantage of ascending and

  1223      * descending order in its input array, and can take advantage of

  1223      * descending order in its input array, and can take advantage of

  1225      * input array.  It is well-suited to merging two or more sorted arrays:

  1225      * input array.  It is well-suited to merging two or more sorted arrays:

  1226      * simply concatenate the arrays and sort the resulting array.

  1226      * simply concatenate the arrays and sort the resulting array.

  1227      *

  1227      *

  1228      * <p>The implementation was adapted from Tim Peters's list sort for Python

  1228      * <p>The implementation was adapted from Tim Peters's list sort for Python

  1229      * (<a href="http://svn.python.org/projects/python/trunk/Objects/listsort.txt">

  1229      * (<a href="http://svn.python.org/projects/python/trunk/Objects/listsort.txt">

  1278      * input arrays to n/2 object references for randomly ordered input

  1278      * input arrays to n/2 object references for randomly ordered input

  1279      * arrays.

  1279      * arrays.

  1280      *

  1280      *

  1281      * <p>The implementation takes equal advantage of ascending and

  1281      * <p>The implementation takes equal advantage of ascending and

  1282      * descending order in its input array, and can take advantage of

  1282      * descending order in its input array, and can take advantage of

  1284      * input array.  It is well-suited to merging two or more sorted arrays:

  1284      * input array.  It is well-suited to merging two or more sorted arrays:

  1285      * simply concatenate the arrays and sort the resulting array.

  1285      * simply concatenate the arrays and sort the resulting array.

  1286      *

  1286      *

  1287      * <p>The implementation was adapted from Tim Peters's list sort for Python

  1287      * <p>The implementation was adapted from Tim Peters's list sort for Python

  1288      * (<a href="http://svn.python.org/projects/python/trunk/Objects/listsort.txt">

  1288      * (<a href="http://svn.python.org/projects/python/trunk/Objects/listsort.txt">

  1405      * input arrays to n/2 object references for randomly ordered input

  1405      * input arrays to n/2 object references for randomly ordered input

  1406      * arrays.

  1406      * arrays.

  1407      *

  1407      *

  1408      * <p>The implementation takes equal advantage of ascending and

  1408      * <p>The implementation takes equal advantage of ascending and

  1409      * descending order in its input array, and can take advantage of

  1409      * descending order in its input array, and can take advantage of

  1411      * input array.  It is well-suited to merging two or more sorted arrays:

  1411      * input array.  It is well-suited to merging two or more sorted arrays:

  1412      * simply concatenate the arrays and sort the resulting array.

  1412      * simply concatenate the arrays and sort the resulting array.

  1413      *

  1413      *

  1414      * <p>The implementation was adapted from Tim Peters's list sort for Python

  1414      * <p>The implementation was adapted from Tim Peters's list sort for Python

  1415      * (<a href="http://svn.python.org/projects/python/trunk/Objects/listsort.txt">

  1415      * (<a href="http://svn.python.org/projects/python/trunk/Objects/listsort.txt">

  1471      * input arrays to n/2 object references for randomly ordered input

  1471      * input arrays to n/2 object references for randomly ordered input

  1472      * arrays.

  1472      * arrays.

  1473      *

  1473      *

  1474      * <p>The implementation takes equal advantage of ascending and

  1474      * <p>The implementation takes equal advantage of ascending and

  1475      * descending order in its input array, and can take advantage of

  1475      * descending order in its input array, and can take advantage of

  1477      * input array.  It is well-suited to merging two or more sorted arrays:

  1477      * input array.  It is well-suited to merging two or more sorted arrays:

  1478      * simply concatenate the arrays and sort the resulting array.

  1478      * simply concatenate the arrays and sort the resulting array.

  1479      *

  1479      *

  1480      * <p>The implementation was adapted from Tim Peters's list sort for Python

  1480      * <p>The implementation was adapted from Tim Peters's list sort for Python

  1481      * (<a href="http://svn.python.org/projects/python/trunk/Objects/listsort.txt">

  1481      * (<a href="http://svn.python.org/projects/python/trunk/Objects/listsort.txt">