```/* nag_zhpevd (f08gqc) Example Program.
*
* NAGPRODCODE Version.
*
* Copyright 2016 Numerical Algorithms Group.
*
* Mark 26, 2016.
*/

#include <stdio.h>
#include <nag.h>
#include <nag_stdlib.h>
#include <nagf08.h>
#include <nagx04.h>
#include <naga02.h>

int main(void)
{
/* Scalars */
Integer i, j, n, ap_len, pdz, w_len;
Integer exit_status = 0;
NagError fail;
Nag_JobType job;
Nag_UploType uplo;
Nag_OrderType order;
/* Arrays */
char nag_enum_arg[40];
Complex *ap = 0, *z = 0;
double *w = 0;

#ifdef NAG_COLUMN_MAJOR
#define A_UPPER(I, J) ap[J * (J - 1) / 2 + I - 1]
#define A_LOWER(I, J) ap[(2 * n - J) * (J - 1) / 2 + I - 1]
#define Z(I, J) z[(J - 1) * pdz + I - 1]
order = Nag_ColMajor;
#else
#define A_LOWER(I, J) ap[I * (I - 1) / 2 + J - 1]
#define A_UPPER(I, J) ap[(2 * n - I) * (I - 1) / 2 + J - 1]
#define Z(I, J) z[(I - 1) * pdz + J - 1]
order = Nag_RowMajor;
#endif

INIT_FAIL(fail);

printf("nag_zhpevd (f08gqc) Example Program Results\n\n");

/* Skip heading in data file */
scanf("%*[^\n] ");
scanf("%" NAG_IFMT "%*[^\n] ", &n);
ap_len = n * (n + 1) / 2;
w_len = n;
pdz = n;

/* Allocate memory */
if (!(ap = NAG_ALLOC(ap_len, Complex)) ||
!(z = NAG_ALLOC(n * n, Complex)) || !(w = NAG_ALLOC(w_len, double)))
{
printf("Allocation failure\n");
exit_status = -1;
goto END;
}
/* Read whether Upper or Lower part of A is stored */
scanf("%39s%*[^\n] ", nag_enum_arg);
/* nag_enum_name_to_value (x04nac).
* Converts NAG enum member name to value
*/
uplo = (Nag_UploType) nag_enum_name_to_value(nag_enum_arg);
/* Read A from data file */
if (uplo == Nag_Upper) {
for (i = 1; i <= n; ++i) {
for (j = i; j <= n; ++j) {
scanf(" ( %lf , %lf )", &A_UPPER(i, j).re, &A_UPPER(i, j).im);
}
}
scanf("%*[^\n] ");
}
else {
for (i = 1; i <= n; ++i) {
for (j = 1; j <= i; ++j) {
scanf(" ( %lf , %lf )", &A_LOWER(i, j).re, &A_LOWER(i, j).im);
}
}
scanf("%*[^\n] ");
}
/* Read type of job to be performed */
scanf("%39s%*[^\n] ", nag_enum_arg);
job = (Nag_JobType) nag_enum_name_to_value(nag_enum_arg);
/* Calculate all the eigenvalues and eigenvectors of A */
/* nag_zhpevd (f08gqc).
* All eigenvalues and optionally all eigenvectors of
* complex Hermitian matrix, packed storage
* (divide-and-conquer)
*/
nag_zhpevd(order, job, uplo, n, ap, w, z, pdz, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_zhpevd (f08gqc).\n%s\n", fail.message);
exit_status = 1;
goto END;
}
/* Normalize the eigenvectors */
for (j = 1; j <= n; j++) {
for (i = n; i >= 1; i--) {
Z(i, j) = nag_complex_divide(Z(i, j), Z(1, j));
}
}
/* Print eigenvalues and eigenvectors */
printf("Eigenvalues\n");
for (i = 0; i < n; ++i)
printf("   %5" NAG_IFMT "     %8.4f\n", i + 1, w[i]);
printf("\n");
/* nag_gen_complx_mat_print_comp (x04dbc).
* Print complex general matrix (comprehensive)
*/
fflush(stdout);
nag_gen_complx_mat_print_comp(order, Nag_GeneralMatrix, Nag_NonUnitDiag, n,
n, z, pdz, Nag_AboveForm, "%7.4f",
"Eigenvectors", Nag_IntegerLabels, 0,
Nag_IntegerLabels, 0, 80, 0, 0, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_gen_complx_mat_print_comp (x04dbc).\n%s\n",
fail.message);
exit_status = 1;
goto END;
}
END:
NAG_FREE(ap);
NAG_FREE(w);
NAG_FREE(z);
return exit_status;
}
```