The most common 2-D array algorithms will involve processing the entire grid, usually row-by-row or column-by-column.

Problem-solving on a matrix could involve processing:

1. one row
2. one column
3. one cell
4. adjacent cells in various different directions

In the next lesson we will look at a 2-D recursive solution to a rather difficult problem.