The **Spiral Matrix** problem takes a 2-Dimensional array of N-rows and M-columns as an input, and prints the elements of this matrix in spiral order.

The spiral begins at the top left corner of the input matrix, and prints the elements it encounters, *while* looping towards the center of this matrix,  in a clockwise manner.
​
# How does the spiral matrix algorithm work?


- First, four variables containing the indices for the corner points of the array are initialized. 
- The algorithm starts from the top left corner of the array, and traverses the first row from left to right. Once it traverses the whole row it does not need to revisit it, thus, it increments the top corner index.
- Once complete, it traverses the rightmost column top to bottom. Again, once this completes, there is no need to revisit the rightmost column, thus, it decrements the right corner index.
- Next, the algorithm traverses the bottommost row and decrements the bottom corner index afterward.
- Lastly, the algorithm traverses the leftmost column, incrementing the left corner index once it’s done.

This continues until the left index is *greater* than the right index, and the top index is *greater* than the bottom index.

# Implementation 

The following code implements the spiral matrix algorithm in C++, Python, and Java:

#include <iostream>
using namespace std;
// Change values of M and N to change the
// dimensions of the input matrix.
#define N 4 
#define M 4

void spiralMatrixPrint(int rows, int cols, int arr[N][M])  {
  
  // Defining the boundaries of the matrix.
  int top = 0, bottom = rows - 1, left = 0, right = cols - 1;
  
  // Defining the direction in which the array is to be traversed.
  int dir = 1;
 
  while (top <= bottom && left <= right) {

    if (dir == 1) {    // moving left->right
      for (int i = left; i <= right; ++i) {
        cout<<arr[top][i]  << " ";
      }
      // Since we have traversed the whole first
      // row, move down to the next row.
      ++top;
      dir = 2;
    } 
    else if (dir == 2) {     // moving top->bottom
      for (int i = top; i <= bottom; ++i) {
          cout<<arr[i][right]  << " ";
      }
      // Since we have traversed the whole last
      // column, move left to the previous column.
      --right;
      dir = 3;
    } 
    else if (dir == 3) {     // moving right->left
      for (int i = right; i >= left; --i) {
          cout<<arr[bottom][i] << " ";
      }
      // Since we have traversed the whole last
      // row, move up to the previous row.
      --bottom;
      dir = 4;
    } 
    else if (dir == 4) {     // moving bottom->up
      for (int i = bottom; i >= top; --i) {
          cout<< arr[i][left] << " ";
      }
      // Since we have traversed the whole first
      // col, move right to the next column.
      ++left;
      dir = 1;
    }
  }
}

int main() {
  // Driver code
  int mat[N][M] = { { 1, 2, 3, 4 }, 
                  { 12, 13, 14, 5 }, 
                  { 11, 16, 15, 6 }, 
                  { 10, 9, 8, 7 } };
  
  spiralMatrixPrint(N, M, mat); 
  return 0; 
}

def spiralMatrixPrint(row, col, arr):
    # Defining the boundaries of the matrix.
    top = 0
    bottom = row-1
    left = 0
    right = col - 1

    # Defining the direction in which the array is to be traversed.
    dir = 0
    
    while (top <= bottom and left <=right):    
        if dir ==0:
            for i in range(left,right+1): # moving left->right
                print (arr[top][i], end=" ")

            # Since we have traversed the whole first
            # row, move down to the next row.
            top +=1
            dir = 1

        elif dir ==1:
            for i in range(top,bottom+1): # moving top->bottom
                print (arr[i][right], end=" ")

            # Since we have traversed the whole last
            # column, move down to the previous column.
            right -=1 
            dir = 2
            
        elif dir ==2:
            for i in range(right,left-1,-1): # moving right->left
                print (arr[bottom][i], end=" ")

            # Since we have traversed the whole last
            # row, move down to the previous row.
            bottom -=1
            dir = 3
            
        elif dir ==3:
            for i in range(bottom,top-1,-1): # moving bottom->top
                print (arr[i][left], end=" ")
            # Since we have traversed the whole first
            # column, move down to the next column.
            left +=1
            dir = 0

# Driver code
# Change the following array and the corresponding row and
# column arguments to test on some other input
array = [[1,2,3,4],
     [12,13,14,5],
     [11,16,15,6],
     [10,9,8,7]]

spiralMatrixPrint(4, 4, array)

Python

import java.io.*; 
class MAIN {
  public static void spiralMatrixPrint(int[][] arr) {

    int rows = arr.length;
    int cols = arr[0].length;
  // Defining the boundaries of the matrix.
  int top = 0, bottom = rows - 1, left = 0, right = cols - 1;
  
  // Defining the direction in which the array is to be traversed.
  int dir = 1;
 
  while (top <= bottom && left <= right) {

    if (dir == 1) {    // moving left->right
      for (int i = left; i <= right; ++i) {
        System.out.print(arr[top][i] + " ");
      }
      // Since we have traversed the whole first
      // row, move down to the next row.
      ++top;
      dir = 2;
    } 
    else if (dir == 2) {     // moving top->bottom
      for (int i = top; i <= bottom; ++i) {
          System.out.print(arr[i][right]+ " ");
      }
      // Since we have traversed the whole last
      // column, move left to the previous column.
      --right;
      dir = 3;
    } 
    else if (dir == 3) {     // moving right->left
      for (int i = right; i >= left; --i) {
          System.out.print(arr[bottom][i]+ " ");
      }
      // Since we have traversed the whole last
      // row, move up to the previous row.
      --bottom;
      dir = 4;
    } 
    else if (dir == 4) {     // moving bottom->up
      for (int i = bottom; i >= top; --i) {
          System.out.print(arr[i][left]+ " ");
      }
      // Since we have traversed the whole first
      // col, move right to the next column.
      ++left;
      dir = 1;
    }
  }   
}
  public static void main(String[] args) 
  { 
    // Driver code
    // Change the following array to test 
    // on some other input
    int a[][] = { {1,2,3,4},
                {5,6,7,8},
                {9,10,11,12}};
    spiralMatrixPrint(a); 
  } 
}

Java

Spiral matrix algorithm

The Spiral Matrix problem takes a 2-Dimensional array of N-rows and M-columns as an input, and prints the elements of this matrix in spiral order. The spiral begins at the top left corner of the input matrix, and prints the elements it encounters, while looping towards the center of this matrix,  in a clockwise manner. ​ How does the spiral matrix algorithm work? 