# Anticlockwise spiral view of diamond matrix elements in php

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

``````<?php
/*
Php 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
public	function spiralView(\$matrix, \$x, \$y, \$p, \$q, \$k)
{
// Find the middle column
\$midCol = \$y + ((int)((\$q - \$y) / 2));
// Get middle row (valid for odd square matrix)
\$midRow = \$midCol;
// Matrix are divided into 4 section
// Starting of middle row and column in form of top
// Case A
// Top to Left-bottom
\$i = \$midCol;
\$j = 0;
while (\$i > \$y && \$k > 0)
{
echo "  ".(\$matrix[\$x + \$j][\$i]);
\$i--;
\$k--;
\$j++;
}
// Case B
// Middle left to middle right bottom
\$i = \$y;
\$j = 0;
while (\$i <= \$midCol && \$k > 0)
{
echo "  ".(\$matrix[(\$midRow) + \$j][\$i]);
\$i++;
\$k--;
\$j++;
}
// Case C
// Middle bottom to middle right side
\$i = \$midCol + 1;
\$j = 1;
while (\$i <= \$q && \$k > 0)
{
echo "  ".(\$matrix[(\$p) - \$j][\$i]);
\$i++;
\$k--;
\$j++;
}
// Case D
// Middle right side to  top middle
\$i = \$q - 1;
\$j = 1;
while (\$i > \$midCol && \$k > 0)
{
echo "  ".(\$matrix[(\$midRow) - \$j][\$i]);
\$i--;
\$k--;
\$j++;
}
if (\$x + 1 <= \$p - 1 && \$k > 0)
{
// Recursive call
\$this->spiralView(\$matrix, \$x + 1,
\$y + 1, \$p - 1, \$q - 1, \$k);
}
}
public	function diamondAnticlockwise(\$matrix)
{
\$row = count(\$matrix);
\$col = count(\$matrix[0]);
// Check whether the given matrix is a valid odd shape or not
if (\$row != \$col || \$col % 2 == 0)
{
// When Yes not a valid size
echo "\nNot a valid perfect Odd square matrix\n";
return;
}
// (row*col)-((col+1)/2)*4 are provide the value of number of
// Diamond element
\$this->spiralView(\$matrix, 0, 0,
\$row - 1, \$col - 1,
(\$row * \$col) - ((int)((\$col + 1) / 2)) * 4);
}
public static
function main(\$args)
{
// Define matrix
\$matrix = array(
array(1, 2, 3, 4, 5),
array(6, 7, 8, 9, 10),
array(11, 12, -1, 15, 16),
array(17, 18, 19, 20, 21),
array(22, 23, 24, 25, 26)
);
}
}
SpiralTraversal::main(array());``````

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.