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:
