From 7dc8777ae0a319805e1d568d9e7afc24ebcaf7a4 Mon Sep 17 00:00:00 2001
From: Amogh Jalan <amoghjalan2005@gmail.com>
Date: Fri, 6 Mar 2020 16:57:59 +0530
Subject: [PATCH 1/2] Spiral Array C++

---
 Spiral_Array/Spiral_Array.cpp | 83 +++++++++++++++++++++++++++++++++++
 1 file changed, 83 insertions(+)
 create mode 100644 Spiral_Array/Spiral_Array.cpp

diff --git a/Spiral_Array/Spiral_Array.cpp b/Spiral_Array/Spiral_Array.cpp
new file mode 100644
index 0000000000..c8b6bef3f1
--- /dev/null
+++ b/Spiral_Array/Spiral_Array.cpp
@@ -0,0 +1,83 @@
+//SPIRAL PRINTING 2-D matrix
+
+#include <iostream>
+using namespace std;
+
+int main()
+{
+    int m, n;
+    int left, right, top, bottom;
+    int i, j, count, dir;
+    int arr[100][100];
+
+    cin>>m>>n;  // Matrix of m*n
+
+    left = 0;
+    right = n-1;
+    top = 0;
+    bottom = m-1;
+
+    count = m * n;        //no. of elements
+    dir = 1;
+
+    for (i=0; i<m; i++)	// Taking Inputs
+    {
+        for (j=0; j<n; j++)
+            cin>>arr[i][j];
+    }
+
+    while (left <= right && top <= bottom && count > 0)
+    {
+        if (dir == 1)		//left to right
+        {
+            for (i = left; i <= right; i++)
+            {
+                cout<<arr[top][i];	//Printing the topmost untraversed row
+                count--;
+            }
+            dir++;
+            top++;
+        }
+        if (dir == 2)		//top to bottom
+        {
+            for (i = top; i <= bottom; i++)
+            {
+                cout<<arr[i][right];	//Printing the rightmost untraversed column
+                count--;
+            }
+            dir++;
+            right--;
+        }
+        if (dir == 3)		//left to right
+        {
+            for (i = right; i >= left; i--)
+            {
+                cout<<arr[bottom][i];	//Printing the bottommost untraversed column
+                count--;
+            }
+            dir++;
+            bottom--;
+        }
+        if (dir == 4)		//bottom to top
+        {
+            for (i = bottom; i >= top; i--)
+            {
+                cout<<arr[i][left];	//Printing the leftmost untraversed column
+                count--;
+            }
+            dir = 1;
+            left++;
+        }
+    }
+    return 0;
+}
+
+/* SAMPLE I/O
+Input
+3 3
+1 2 3
+4 5 6
+7 8 9
+Output
+1 2 3 6 9 8 7 4 5
+*/

From 147137903198e1b79b45cb8b3a6cb59afa782e6b Mon Sep 17 00:00:00 2001
From: Amogh Jalan <amoghjalan2005@gmail.com>
Date: Mon, 9 Mar 2020 18:01:10 +0530
Subject: [PATCH 2/2] Changes Added

---
 Spiral_Array/Spiral_Array.cpp | 24 ++++++++++++------------
 1 file changed, 12 insertions(+), 12 deletions(-)

diff --git a/Spiral_Array/Spiral_Array.cpp b/Spiral_Array/Spiral_Array.cpp
index c8b6bef3f1..787c864e80 100644
--- a/Spiral_Array/Spiral_Array.cpp
+++ b/Spiral_Array/Spiral_Array.cpp
@@ -1,4 +1,4 @@
-//SPIRAL PRINTING 2-D matrix
+// SPIRAL PRINTING 2-D matrix
 
 #include <iostream>
 using namespace std;
@@ -10,29 +10,29 @@ int main()
     int i, j, count, dir;
     int arr[100][100];
 
-    cin>>m>>n;  // Matrix of m*n
+    cin >> m >> n;  // Matrix of m*n
 
     left = 0;
     right = n-1;
     top = 0;
     bottom = m-1;
 
-    count = m * n;        //no. of elements
+    count = m * n;        // no. of elements
     dir = 1;
 
-    for (i=0; i<m; i++)	// Taking Inputs
+    for (i = 0; i < m; i++)	// Taking Inputs
     {
-        for (j=0; j<n; j++)
-            cin>>arr[i][j];
+        for (j = 0; j < n; j++)
+            cin >> arr[i][j];
     }
 
     while (left <= right && top <= bottom && count > 0)
     {
-        if (dir == 1)		//left to right
+        if (dir == 1)		// left to right
         {
             for (i = left; i <= right; i++)
             {
-                cout<<arr[top][i];	//Printing the topmost untraversed row
+                cout << arr[top][i];	// Printing the topmost untraversed row
                 count--;
             }
             dir++;
@@ -42,7 +42,7 @@ int main()
         {
             for (i = top; i <= bottom; i++)
             {
-                cout<<arr[i][right];	//Printing the rightmost untraversed column
+                cout << arr[i][right];	// Printing the rightmost untraversed column
                 count--;
             }
             dir++;
@@ -52,17 +52,17 @@ int main()
         {
             for (i = right; i >= left; i--)
             {
-                cout<<arr[bottom][i];	//Printing the bottommost untraversed column
+                cout << arr[bottom][i];	// Printing the bottommost untraversed column
                 count--;
             }
             dir++;
             bottom--;
         }
-        if (dir == 4)		//bottom to top
+        if (dir == 4)		// bottom to top
         {
             for (i = bottom; i >= top; i--)
             {
-                cout<<arr[i][left];	//Printing the leftmost untraversed column
+                cout << arr[i][left];	// Printing the leftmost untraversed column
                 count--;
             }
             dir = 1;