Print the matrix diagonally downwards

Given a matrix of size n*n, print the matrix in the following pattern.


Output: 1 2 5 3 6 9 4 7 10 13 8 11 14 12 15 16

Examples:

Input :matrix[2][2]= { {1, 2},
                       {3, 4} }
Output : 1 2 3 4

Input :matrix[3][3]= { {1, 2, 3},
                       {4, 5, 6},
                       {7, 8, 9} }
Output : 1 2 4 3 5 7 6 8 9


Following is the C++ implementation for the above pattern.

filter_none

edit
close

play_arrow

link
brightness_4
code

// CPP program to print matrix downward
#include <bits/stdc++.h>
using namespace std;
  
void printMatrixDiagonallyDown(vector<vector<int> > matrix, 
                                                    int n)
{
    // printing elements above and on 
    // second diagonal
    for (int k = 0; k < n; k++) {
  
        // traversing downwards starting
        // from first row
        int row = 0, col = k;
        while (col >= 0) {
            cout << matrix[row][col] << " ";
            row++, col--;
        }
    }
  
    // printing elements below second
    // diagonal
    for (int j = 1; j < n; j++) {
  
        // traversing downwards starting 
        // from last column
        int col = n - 1, row = j;
        while (row < n) {
            cout << matrix[row][col] << " ";
            row++, col--;
        }
    }
}
  
int main()
{
    vector<vector<int> > matrix{ { 1, 2, 3 },
                                 { 4, 5, 6 },
                                 { 7, 8, 9 } };
    int n = 3;
    printMatrixDiagonallyDown(matrix, n);
    return 0;
}

chevron_right


Output:

1 2 4 3 5 7 6 8 9

Time Complexity: O(n*n)



My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.



Improved By : Hinarawat