Lesson 2

Traversing a 2D Matrix in C++

Introduction

Hello, fellow coder! Are you excited to dive into a new, intriguing coding challenge? In this lesson, we're going to explore special traversals of matrices. Using the C++ programming language, we'll find our way through a matrix by climbing up and down the columns, zigzagging as we go. Sound exciting? Buckle up, then, and get ready!

Task Statement

Here's the task: you've been given a 2D matrix consisting of individual cells, each holding a unique integer value. Your goal is to create a function that will traverse this matrix, starting at the bottom-right cell. From there, you'll travel up to the top of the same column, then move left to the next column, and then continue downward from the top of this new column. After reaching the bottom of the column, you again move left and start moving upward. This unique traverse pattern will be performed until all the cells have been visited.

Consider this small 3×43 \times 4 matrix as an example:

C++
1{ 2 {1, 2, 3, 4}, 3 {5, 6, 7, 8}, 4 {9, 10, 11, 12} 5}

With the described traversal pattern, your function should return this list: [12, 8, 4, 3, 7, 11, 10, 6, 2, 1, 5, 9].

Solution Building: Step 1

The first step towards a solution is understanding the dimensions of the matrix with which we're working. We can do this using C++'s member functions such as size(). Let's set up our function and identify the matrix size:

C++
1#include <vector> 2#include <iostream> 3 4std::vector<int> column_traverse(const std::vector<std::vector<int>>& matrix) { 5 int rows = matrix.size(); 6 int cols = matrix[0].size(); 7}
Solution Building: Step 2

Now that we're aware of the matrix dimensions, we should establish the starting point (bottom-right) and the direction of travel (upward initially). Additionally, we'll need a vector to keep track of the cells we've visited in order:

C++
1#include <vector> 2#include <iostream> 3 4std::vector<int> column_traverse(const std::vector<std::vector<int>>& matrix) { 5 int rows = matrix.size(); 6 int cols = matrix[0].size(); 7 std::string direction = "up"; 8 int row = rows - 1; 9 int col = cols - 1; 10 std::vector<int> output; 11}
Solution Building: Step 3

It's time to go exploring! We'll now implement a while loop to traverse the matrix. This loop will continue until we have covered all the cells in the matrix. As we "visit" each cell, we'll add the value in the cell to our vector.

C++
1#include <vector> 2#include <iostream> 3 4std::vector<int> column_traverse(const std::vector<std::vector<int>>& matrix) { 5 int rows = matrix.size(); 6 int cols = matrix[0].size(); 7 std::string direction = "up"; 8 int row = rows - 1; 9 int col = cols - 1; 10 std::vector<int> output; 11 12 while (output.size() < rows * cols) { 13 output.push_back(matrix[row][col]); 14 15 if (direction == "up") { 16 if (row - 1 < 0) { 17 direction = "down"; 18 col -= 1; 19 } else { 20 row -= 1; 21 } 22 } else { 23 if (row + 1 == rows) { 24 direction = "up"; 25 col -= 1; 26 } else { 27 row += 1; 28 } 29 } 30 } 31 32 return output; 33}

That's it, we've completed the function! This C++ function will return the output vector, which gives us the order of traversal through the matrix.

Traverse Using Decreasing Range

Let's explore one more way of traversal. We can leverage the utility of C++'s for-loop to traverse a 2D matrix in reverse order. This flexibility can also create a sequence that decrements.

To achieve this, we use a for-loop with decrementing indices.

Consider our familiar 3×43 \times 4 matrix:

C++
1{ 2 {1, 2, 3, 4}, 3 {5, 6, 7, 8}, 4 {9, 10, 11, 12} 5}

Using decrementing loops, the reverse traverse pattern would produce this list: {12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1}.

Here's how we can implement this reverse traversal:

C++
1#include <vector> 2#include <iostream> 3 4std::vector<int> reverse_traverse(const std::vector<std::vector<int>>& matrix) { 5 int rows = matrix.size(); 6 int cols = matrix[0].size(); 7 std::vector<int> output; 8 9 for (int row = rows - 1; row >= 0; --row) { 10 for (int col = cols - 1; col >= 0; --col) { 11 output.push_back(matrix[row][col]); 12 } 13 } 14 15 return output; 16}

In this function, we start the loop for row from rows - 1 and run it to 0, decrementing it at each step. Similarly, our nested loop for col starts from cols - 1 and goes to 0. This allows us to start from the bottom-right corner and traverse leftward, then upward, covering the entire matrix in reverse order.

As you gain proficiency in matrix traversal in C++, you'll discover the many creative ways to utilize C++'s flexible syntax. The more you experiment with different traversal methods, the better you become! Happy practicing!

Lesson Summary

Congratulations! You have made it through a challenging task in which you maneuvered your way through complex matrix traversal patterns. The functions you've designed not only test your C++ coding skills but also your ability to visualize spatial patterns.

It's time to put your new knowledge to the test! The next step is to tackle similar challenges on your own. I encourage you to use this lesson as your guide and don't forget to experiment with different matrix sizes and cell values. With plenty of practice, you'll soon master these traversing patterns!

Enjoy this lesson? Now it's time to practice with Cosmo!

Practice is how you turn knowledge into actual skills.