sortD()

template<typename Sorter>

void QuickSorter< Sorter >::sortD ( )

private

Definition at line 322 of file monsort.hpp.

{
  unsigned long i, ir, j, l;
  value rra;
  long ncmps;
 
  ncmps = 0;
  if (len < 2) return;
  l = (len >> 1) + 1;
  ir = len;
  for (;;)
    {
      if (l > 1)
        {
          rra = elems[--l];
        }
      else
        {
          rra = elems[ir];
          elems[ir] = elems[1];
          if (--ir == 1)
            {
              elems[1] = rra;
              break;
            }
        }
      i = l;
      j = l + l;
      while (j <= ir)
        {
          if (j < ir)
            {
              ncmps++;
              if (M->compare(elems[j], elems[j + 1]) < 0) j++;
            }
          ncmps++;
          if (M->compare(rra, elems[j]) < 0)
            {
              elems[i] = elems[j];
              i = j;
              j <<= 1;
            }
          else
            j = ir + 1;
        }
      elems[i] = rra;
    }
  fprintf(stderr, "hpsort: %ld, %ld\n", len, ncmps);
}

References elems, len, and M.

Referenced by sort().