What is the worst-case complexity of the following code?

void diag (double* d[], int n) { for (int i = 0, i != n, i++) { d[i] = new double[n]; for (int j = 0; j != n; j++) { d[i][j] = i + j; for (int k = 0; k != i; k++) d[i][k] += d[k][j] + d[i][k]; } } }