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 = i; j < 2*i; j++) { d[i][j] = i + j; } } }