code: public static void hybridSort(Object[] a, Comparator<Object> cmp)
      {
          hybridSort(a, 0, a.length - 1, cmp, log2(a.length) * 2);
      }
docs: /*
  Hybrid sorting mechanism similar to Introsort by David Musser. Uses quicksort's
  partitioning mechanism recursively until the resulting array is small or the
  recursion is too deep, and then use insertion sort for the rest.
  This is the same basic algorithm used by the GNU Standard C++ library.