/* nag_rngs_binomial (g05mjc) Example Program. * * Copyright 2001 Numerical Algorithms Group. * * Mark 7, 2001. */ #include #include #include #include int main(void) { /* Scalars */ double p; Integer i, igen, m, n, nr; Integer exit_status=0; NagError fail; /* Arrays */ double *r=0; Integer *x=0; Integer iseed[4]; INIT_FAIL(fail); Vprintf("nag_rngs_binomial (g05mjc) Example Program Results\n\n"); n = 20; nr = 6007; /* Allocate memory */ if ( !(r = NAG_ALLOC(nr, double)) || !(x = NAG_ALLOC(n, Integer)) ) { Vprintf("Allocation failure\n"); exit_status = -1; goto END; } /* Set the distribution parameters P and M */ p = 0.8; m = 6000; /* Initialise the seed to a repeatable sequence */ iseed[0] = 1762543; iseed[1] = 9324783; iseed[2] = 42344; iseed[3] = 742355; /* igen identifies the stream. */ igen = 1; /* nag_rngs_init_repeatable (g05kbc). * Initialize seeds of a given generator for random number * generating functions (that pass seeds explicitly) to give * a repeatable sequence */ nag_rngs_init_repeatable(&igen, iseed); /* Choose MODE = 2 */ /* nag_rngs_binomial (g05mjc). * Generates a vector of random integers from a binomial * distribution, seeds and generator number passed * explicitly */ nag_rngs_binomial(2, m, p, n, x, igen, iseed, r, &fail); if (fail.code != NE_NOERROR) { Vprintf("Error from nag_rngs_binomial (g05mjc).\n%s\n", fail.message); exit_status = 1; goto END; } for (i = 0; i < n; ++i) { Vprintf("%12ld\n", x[i]); } END: if (r) NAG_FREE(r); if (x) NAG_FREE(x); return exit_status; }