Function main

All Algorithms/strassen.cpp:249–327

}

int main() {
    clock_t start, end;
    int r1, c1 = 0, r2 = 1, c2;
    int **A, **B, **C;

    while (c1 != r2) {
        cout << "Column of Matrix A needs to be equal to row of matrix B" << endl;
        cout << "Enter the row of matrix A: ";
        cin >> r1;
        cout << "Enter the column of matrix A: ";
        cin >> c1;
        cout << "Enter the row of matrix B: ";
        cin >> r2;
        cout << "Enter the column of matrix B: ";
        cin >> c2;
    }

    // Converting dimension to 2^n because Strassen's Matrix Multiplication Algorithm works only on square
    // matrices whose dimension is a power of 2.
    int n = highestPowerof2(max(r1, max(c1, c2)));
    A = initializeMatrix(n);
    B = initializeMatrix(n);
    setToZero(A, n, n);
    setToZero(B, n, n);

    input(A, r1, c1);

    // printMatrix(A, r1, c1);

    input(B, r2, c2);


    start = clock();
    C = multiply(A, B, n, n, n);
    end = clock();
    double time_taken = double(end - start) / CLOCKS_PER_SEC;
    printMatrix(C, n, n);
    cout << "Normal Multipliction of TC O(n^3): " << time_taken << " sec" << endl;


    int** D = initializeMatrix(n);
    setToZero(D, n , n);
    start = clock();
    D = strassenMultiply(A, B, n);
    end = clock();
    time_taken = double(end - start) / CLOCKS_PER_SEC;
    cout << "divideAndConquer O(n^3): " << time_taken << " sec" << endl;

    int** E = initializeMatrix(n);
    setToZero(E, n , n);
    start = clock();
    E = strassenMultiply(A, B, n);
    end = clock();
    time_taken = double(end - start) / CLOCKS_PER_SEC;
    cout << "strassenMultiply of TC O(n^2.8): " << time_taken << " sec" << endl;


    for (int i = 0; i < r1; i++)