Matrix Multiplication Algorithm Complexity [duplicate]

Question

I have this Java code for matrix multiplication:

double[][] product(double[][] x, double[][] y) {
    double[][] z = new double[x.length][y[0].length];
    for (int i = 0; i < x.length; i++) {
        for (int j = 0; j < y[0].length; j++) {
            double sum = 0.0;
            for (int k = 0; k < x[0].length; k++) {
                sum += x[i][k]*y[k][j];
            }
            z[i][j] = sum;
        }
    }
    return z;
}

What is the time complexity of this algorithm ? Can I say it is O(n^3) ?

Chittebbayi Penugonda · Accepted Answer · 2020-11-03 18:08:42Z

1

Yes I think it is O(n^3) since you have three loops inside each other

answered Nov 3, 2020 at 18:08

Chittebbayi Penugonda

744 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Matrix Multiplication Algorithm Complexity [duplicate]

1 Answer 1

Comments

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Linked

Related