int check( double *nsorted, double *sorted, int n)
{
  char * t = malloc( sizeof(char) * n);
  int i, j, sum ;
  for (i = 0 ; i < n ; i++)
    t[i] = 0;
  for (i = 0 ; i < n ; i++)
    for (j = 0 ; j < n; j++)
      if ((sorted[i] == nsorted[j])&& (t[j] == 0))
      {
        t[j] = 1;
        break;
      }
  sum = 0;
  for (i = 0 ; i < n ; i++)
  {
    sum += t[j];
  }
  free(t);
  if (sum != n)
    return 1;
  double *x = malloc(sizeof(double) * n);
  for (i = 0 ; i < n ; i++)
    x[i] = nsorted[i];
  qsort(x, n, sizeof(double),comparem);
  for (i = 0 ; i < n ; i++)
    if (fabs(x[i]) != fabs(sorted[i]))
    {
      free(x);
      return 1;
    }
  free(x);
  return 0;