#include "djbsort.h"

/* can save time by vectorizing xor loops */
/* can save time by integrating xor loops with int32_sort */

void uint32_sort(uint32_t *x,long long n)
{
  long long j;
  for (j = 0;j < n;++j) x[j] ^= 0x80000000;
  int32_sort((int32_t *) x,n);
  for (j = 0;j < n;++j) x[j] ^= 0x80000000;
}
