sort_partition()

template<typename Sorter>

long QuickSorter< Sorter >::sort_partition ( long lo, long hi )

private

Definition at line 80 of file monsort.hpp.

{
  value pivot = elems[lo];
  long i = lo - 1;
  long j = hi + 1;
  for (;;)
    {
      do
        {
          j--;
        }
      while (M->compare(elems[j], pivot) < 0);
      do
        {
          i++;
        }
      while (M->compare(elems[i], pivot) > 0);
 
      if (i < j)
        {
          value tmp = elems[j];
          elems[j] = elems[i];
          elems[i] = tmp;
        }
      else
        return j;
    }
}

References elems, and M.

Referenced by sort().