Printing 2D Grids and Matrices Using Nested Loops
Learn how nested loops are perfectly suited for interacting with 2D Arrays, matrices, and grids, mapping code to coordinate systems.
When Nested Loops are Mandatory
We spend a lot of time learning to destroy nested loops. However, in one specific domain, nested loops are not a brute-force mistake they are the optimal, strictly required solution: 2D Data Structures.
Understanding 2D Arrays
A 2D array is an array of arrays. Think of it as an Excel spreadsheet or a chessboard. It has rows and columns.
To access data, you need two coordinates: grid[row][column].
The Nested Loop Traversal
Because you need to access every cell in the grid, you need one loop to handle the rows, and an inner loop to handle the columns.
// Assume grid is a 3x3 matrix
for (int row = 0; row < grid.length; row++) {
for (int col = 0; col < grid[row].length; col++) {
print(grid[row][col]);
}
}
Execution Flow on a Grid
- The outer loop locks onto
row = 0(the very top row). - The inner loop spins up, iterating
col = 0,1,2. It reads every cell in that top row from left to right. - The inner loop finishes. The outer loop moves to
row = 1(the middle row). - The inner loop spins up again, reading left to right.
Time Complexity Context
Traversing an N x N matrix requires N^2 operations. Because the actual size of the dataset is N^2, this nested loop operates in O(Total Data) linear time, not quadratic time!
The Takeaway
When dealing with geometric data, grids, pixels, or matrices, nested loops are the correct architectural choice. The outer loop controls the Y-axis (vertical rows), and the inner loop controls the X-axis (horizontal columns).
A matrix is two-dimensional. You need an outer loop to traverse vertically through the rows, and an inner loop to traverse horizontally through the columns.
It is standard 2D array access notation. It retrieves the exact value located at the specified row (Y-axis) and column (X-axis) coordinate.
If N is the width of a square matrix, traversing the N x N grid takes O(N^2) operations. However, relative to the total number of items (M), the traversal is O(M) linear time.
Simply invert the loops. Make the outer loop iterate over the columns (0 to width), and the inner loop iterate over the rows (0 to height).
A jagged array is a 2D array where the rows have varying lengths. This is why the inner loop bounds should always use grid[row].length dynamically.