/* nag_ranks_and_scores (g01dhc) Example Program. * * Copyright 1996 Numerical Algorithms Group. * * Mark 4, 1996. * Mark 8 revised, 2004. * */ #include #include #include #include int main(void) { Integer exit_status=0, i, n; NagError fail; double *r=0, *x=0; INIT_FAIL(fail); Vprintf("nag_ranks_and_scores (g01dhc) Example Program Results\n\n"); /* Skip heading in data file */ Vscanf("%*[^\n] "); Vscanf("%ld ", &n); if (n>=1) { if ( !( r = NAG_ALLOC(n, double)) || !( x = NAG_ALLOC(n, double)) ) { Vprintf("Allocation failure\n"); exit_status = -1; goto END; } } else { Vprintf("Invalid n.\n"); exit_status = 1; return exit_status; } for (i = 1; i <= n; ++i) Vscanf("%lf ", &x[i - 1]); /* nag_ranks_and_scores (g01dhc). * Ranks, Normal scores, approximate Normal scores or * exponential (Savage) scores */ nag_ranks_and_scores(Nag_SavageScores, Nag_AverageTies, n, x, r, &fail); if (fail.code != NE_NOERROR) { Vprintf("Error from nag_ranks_and_scores (g01dhc).\n%s\n", fail.message); exit_status = 1; goto END; } Vprintf("The Savage Scores : \n"); Vprintf(" (Average scores are used for tied observations)\n\n"); for (i = 1; i <= n; ++i) Vprintf("%10.4f\n", r[i - 1]); END: if (r) NAG_FREE(r); if (x) NAG_FREE(x); return exit_status; }