/* MYSORT.C: a simple C program for sorting a list of numbers and an associated
 *           ordered sequence for the list (0 to n-1), returning the sorted list
 *           and the permuted indices
 *
 *           John Rust, University of Maryland, July, 2003 */

int mysort(double *x,double *slist,int *sindex,int n)
{

    int i,j,jj,mi,mis,loop,*ls,*index;
    double *xs,*list,mn;

    xs=(double *) malloc(n*sizeof(double)); 
    list=(double *) malloc(n*sizeof(double)); 
    ls=(int *) malloc(n*sizeof(int)); 
    index=(int *) malloc(n*sizeof(int)); 
    loop=0;

    for (i=0; i<n; i++)
    {
       list[i]=x[i];
       index[i]=i;
    }

    while (n > 0)
    {

      for (i=0; i<n; i++)
      {
        xs[i]=list[i];
	ls[i]=index[i];
      }

      mn=list[0];
      mis=index[0];
      mi=0;

      for (i=1; i<n; i++) 
      {
        if (list[i] < mn) 
        {
           mn=list[i];
	   mis=index[i];
	   mi=i;
        }
      }

      slist[loop]=mn;
      sindex[loop]=mis;
      loop++;

      jj=0;
      for (j=0; j<n; j++)
      {
        if (j != mi)
        {
	   list[jj]=xs[j];
	   index[jj]=ls[j];
           jj++;
        }
      }

      n--;

    }

    free(xs);
    free(ls);
    free(list);
    free(index);

    return 1; 
}