NAG Library Manual, Mark 27.3
```/* nag_blast_imin_val (f16dpc) Example Program.
*
* Copyright 2021 Numerical Algorithms Group.
*
* Mark 27.3, 2021.
*/

#include <nag.h>
#include <stdio.h>

int main(void) {
/* Scalars */
Integer exit_status, i, incx, j, jx, k, n;
/* Arrays */
Integer *x = 0;
/* Nag Types */
NagError fail;

exit_status = 0;
INIT_FAIL(fail);

printf("nag_blast_imin_val (f16dpc) Example Program Results\n\n");

/* Skip heading in data file */
scanf("%*[^\n] ");
/* Read the number of elements and the increment */
scanf("%" NAG_IFMT "%" NAG_IFMT "%*[^\n] ", &n, &incx);

if (n > 0) {
/* Allocate memory */
if (!(x = NAG_ALLOC(MAX(1, 1 + (n - 1) * ABS(incx)), Integer))) {
printf("Allocation failure\n");
exit_status = -1;
goto END;
}
} else {
printf("Invalid n\n");
exit_status = 1;
goto END;
}

/* Read the vector x and store forwards or backwards
* as determined by incx. */
for (j = 0, jx = (incx > 0 ? 0 : (1 - n) * incx); j < n; j++, jx += incx)
scanf("%" NAG_IFMT "", &x[jx]);
scanf("%*[^\n] ");

/* nag_blast_imin_val (f16dpc).
* Get minimum value (i) and location of that value (k)
* of Integer vector */
nag_blast_imin_val(n, x, incx, &k, &i, &fail);

if (fail.code != NE_NOERROR) {
printf("Error from nag_blast_imin_val (f16dpc).\n%s\n", fail.message);
exit_status = 1;
goto END;
}

/* Print the minimum value */
printf("Minimum element of x is %12" NAG_IFMT "\n", i);
/* Print its location */
printf("Index of minimum element of x is %3" NAG_IFMT "\n", k);

END:
NAG_FREE(x);

return exit_status;
}
```