Traverse a given Matrix using Recursion
Given a matrix arr of size N x M, the task is to traverse this matrix using recursion.
Examples:
Input: arr[][] = {{1, 2, 3},
{4, 5, 6},
{7, 8, 9}}
Output: 1, 2, 3, 4, 5, 6, 7, 8, 9
Input: M[][] = {{11, 12, 13},
{14, 15, 16},
{17, 18, 19}}
Output: 11, 12, 13, 14, 15, 16, 17, 18, 19
Approach: Below are the steps to traverse the Matrix recursively:
- Base Case: If the current row or column exceeds the size N or M, respectively, the recursion is stopped.
- If the current column exceeds the total number of columns M, then the next row is started.
if (current_col >= M) This row ends. Start for next row - If the current row exceeds the total number of rows N, then the complete traversal is stopped.
if (current_row >= N) Matrix has been traversed completely
- If the current column exceeds the total number of columns M, then the next row is started.
- Recursive Case: In each recursive call,
- The current element of the Matrix is printed.
- Two recursive calls are made:
- One to traverse the next row, and
- Another to traverse the next column.
After we print all the elements of the row and when we move on to the next column, this again calls the row in recursion, thereby printing all the elements of the matrix.
Below is the implementation of the above approach:
C++
// C++ program to traverse the matrix recursively #include <iostream> using namespace std; #define N 2 #define M 3 // Function to traverse the matrix recursively int traverseMatrix(int arr[N][M], int current_row, int current_col) { // If the entire column is traversed if (current_col >= M) return 0; // If the entire row is traversed if (current_row >= N) return 1; // Print the value of the current // cell of the matrix cout << arr[current_row][current_col] << ", "; // Recursive call to traverse the matrix // in the Horizontal direction if (traverseMatrix(arr, current_row, current_col + 1) == 1) return 1; // Recursive call for changing the // Row of the matrix return traverseMatrix(arr, current_row + 1, 0); } // Driver code int main() { int arr[N][M] = { { 1, 2, 3 }, { 4, 5, 6 } }; traverseMatrix(arr, 0, 0); return 0; } |
chevron_right
filter_none
Java
// Java program to traverse the matrix recursively class GFG { final static int N = 2; final static int M = 3; // Function to traverse the matrix recursively static int traverseMatrix(int arr[][], int current_row, int current_col) { // If the entire column is traversed if (current_col >= M) return 0; // If the entire row is traversed if (current_row >= N) return 1; // Print the value of the current // cell of the matrix System.out.print(arr[current_row][current_col] + ", "); // Recursive call to traverse the matrix // in the Horizontal direction if (traverseMatrix(arr, current_row, current_col + 1) == 1) return 1; // Recursive call for changing the // Row of the matrix return traverseMatrix(arr, current_row + 1, 0); } // Driver code public static void main (String[] args) { int arr[][] = { { 1, 2, 3 }, { 4, 5, 6 } }; traverseMatrix(arr, 0, 0); } } // This code is contributed by AnkitRai01 |
chevron_right
filter_none
C#
// C# program to traverse the matrix recursively using System; public class GFG { static int N = 2; static int M = 3; // Function to traverse the matrix recursively static int traverseMatrix(int [,]arr, int current_row, int current_col) { // If the entire column is traversed if (current_col >= M) return 0; // If the entire row is traversed if (current_row >= N) return 1; // Print the value of the current // cell of the matrix Console.Write(arr[current_row,current_col] + ", "); // Recursive call to traverse the matrix // in the Horizontal direction if (traverseMatrix(arr, current_row, current_col + 1) == 1) return 1; // Recursive call for changing the // Row of the matrix return traverseMatrix(arr, current_row + 1, 0); } // Driver code public static void Main (string[] args) { int [,]arr = { { 1, 2, 3 }, { 4, 5, 6 } }; traverseMatrix(arr, 0, 0); } } // This code is contributed by AnkitRai01 |
chevron_right
filter_none
Python3
# Python3 program to traverse the matrix recursively N = 2 M = 3 # Function to traverse the matrix recursively def traverseMatrix(arr, current_row, current_col) : # If the entire column is traversed if (current_col >= M) : return 0; # If the entire row is traversed if (current_row >= N) : return 1; # Print the value of the current # cell of the matrix print(arr[current_row][current_col],end= ", "); # Recursive call to traverse the matrix # in the Horizontal direction if (traverseMatrix(arr, current_row, current_col + 1 ) == 1) : return 1; # Recursive call for changing the # Row of the matrix return traverseMatrix(arr, current_row + 1, 0); # Driver code if __name__ == "__main__" : arr = [ [ 1, 2, 3 ], [ 4, 5, 6 ] ]; traverseMatrix(arr, 0, 0); # This code is contributed by AnkitRai01 |
chevron_right
filter_none
Output:
1, 2, 3, 4, 5, 6,
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
Recommended Posts:
- Traverse the matrix in Diagonally Bottum-Up fashion using Recursion
- Traverse Linked List from middle to left-right order using recursion
- Traverse matrix in L shape
- Count of ways to traverse a Matrix according to given conditions
- Count the number of ways to traverse a Matrix
- Count of ways to traverse a Matrix and return to origin in K steps
- Min number of moves to traverse entire Matrix through connected cells with equal values
- C program to traverse an Array
- Shortest path to traverse all the elements of a circular array in increasing order
- Minimum number of steps to convert a given matrix into Diagonally Dominant Matrix
- Minimum steps required to convert the matrix into lower hessenberg matrix
- Minimum number of steps to convert a given matrix into Upper Hessenberg matrix
- Check if matrix can be converted to another matrix by transposing square sub-matrices
- Program to check diagonal matrix and scalar matrix
- Circular Matrix (Construct a matrix with numbers 1 to m*n in spiral way)
- Check if a given matrix can be converted to another given matrix by row and column exchanges
- Convert given Matrix into sorted Spiral Matrix
- Count frequency of k in a matrix of size n where matrix(i, j) = i+j
- Maximize sum of N X N upper left sub-matrix from given 2N X 2N matrix
- Check if it is possible to make the given matrix increasing matrix or not
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 : AnkitRai01
- Real-time application of Data Structures
- Count of substrings of length K with exactly K distinct characters
- Replace every element of array with sum of elements on its right side
- Longest subarray whose elements can be made equal by maximum K increments
- Finding Median of unsorted Array in linear time using C++ STL