# Anticlockwise spiral view of diamond matrix elements in swift

Swift program for Anticlockwise spiral view of diamond matrix elements. Here more solutions.

``````import Foundation
/*
Swift 4 program for
Anticlockwise spiral view of diamond element in matrix
*/
class SpiralTraversal
{
// Method which is displaying the Anticlockwise spiral
// Of matrix in diamond(mid) element
func spiralView(_ matrix: [[Int]],
_ x: Int, _ y: Int, _ p: Int, _ q: Int, _ size: Int)
{
var k: Int = size;
// Find the middle column
let midCol: Int = y + ((q - y) / 2);
// Get middle row (valid for odd square matrix)
let midRow: Int = midCol;
// Matrix are divided into 4 section
// Starting of middle row and column in form of top
// Case A
// Top to Left-bottom
var i: Int = midCol;
var j: Int = 0;
while (i > y && k > 0)
{
print(matrix[x + j][i], terminator: "  ");
i -= 1;
k -= 1;
j += 1;
}
// Case B
// Middle left to middle right bottom
i = y;
j = 0;
while (i <= midCol && k > 0)
{
print(matrix[(midRow) + j][i], terminator: "  ");
i += 1;
k -= 1;
j += 1;
}
// Case C
// Middle bottom to middle right side
i = midCol + 1;
j = 1;
while (i <= q && k > 0)
{
print(matrix[(p) - j][i], terminator: "  ");
i += 1;
k -= 1;
j += 1;
}
// Case D
// Middle right side to  top middle
i = q - 1;
j = 1;
while (i > midCol && k > 0)
{
print(matrix[(midRow) - j][i], terminator: "  ");
i -= 1;
k -= 1;
j += 1;
}
if (x + 1 <= p - 1 && k > 0)
{
// Recursive call
self.spiralView(matrix, x + 1, y + 1, p - 1, q - 1, k);
}
}
func diamondAnticlockwise(_ matrix:[[Int]])
{
let row: Int = matrix.count;
let col: Int = matrix[0].count;
// Check whether the given matrix is a valid odd shape or not
if (row  != col || col % 2 == 0)
{
// When Yes not a valid size
print("\nNot a valid perfect Odd square matrix");
return;
}
// (row*col)-((col+1)/2)*4 are provide the value of number of
// Diamond element
self.spiralView( matrix, 0, 0,
row - 1, col - 1,
(row * col) - ((col + 1) / 2) * 4);
}
static func main()
{
// Define matrix
let matrix: [
[Int]
] = [
[1, 2, 3, 4, 5],
[6, 7, 8, 9, 10],
[11, 12, -1, 15, 16],
[17, 18, 19, 20, 21],
[22, 23, 24, 25, 26]
];
}
}
SpiralTraversal.main();``````

Output

``3  7  11  18  24  20  16  9  8  12  19  15  -1``

## Comment

Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.