[patch #5709] Augmented Balanced Tree data structure

Follow-up Comment #3, patch #5709 (project pspp):

You're right.

I would have probably written something like:

static void
reverse (int *values, size_t cnt) 
{
 size_t i = 0;
 size_t j = cnt - 1;

 while (j > i ) 
   swap (values[i++], values[j--]);
}

    _______________________________________________________

Reply to this item at:

  <http://savannah.gnu.org/patch/?5709>

_______________________________________________
  Message sent via/by Savannah
  http://savannah.gnu.org/