TheDeveloperBlog.com
C-Sharp | Java | Python | Swift | GO | WPF | Ruby | Scala | F# | JavaScript | SQL | PHP | Angular | HTML
Program To Print Pattern 8
Program To Print Pattern 8 on fibonacci, factorial, prime, armstrong, swap, reverse, search, sort, stack, queue, array, linkedlist, tree, graph, pattern, string etc.
Write a program to print the following pattern on the console.
Algorithm
Solution:C Program:
#include <stdio.h>
int matrix[10][10];
int main()
{
int i,j,k,l;
int direction=1;
printf("Matrix before snake=\n");
for(i=0;i<10;i++){ //this loop is used to print one line of a matrix
for(j=0;j<10;j++){// this loop is used to print one element in a line
printf("%d\t",matrix[i][j]);
}
printf("\n");
}
for(i=1,j=0,k=0;i<=100;i++){ /*this is loop is used to set martixpattern */
matrix[j][k]=i;
switch(direction){ //switch is used to check direction of snake
case 1:if(k+1<10){
if(matrix[j][k+1]==0){
k++; //if direction is one and martix[j][k+1] is 0
continue;
}
else{
j++;//if direction is one but k+1 is not smaller than 10
direction=2;
continue;
}
}
else{ //if direction is one and martix[j][k+1] is 0
j++;
direction=2;
continue;
}
break;
case 2:if(j+1<10){
if(matrix[j+1][k]==0){ /* if direction=2 and matrix[j+1][k]=0 */
j++;
continue;
}
else{
direction=3;
k--; // if matrix[j+1][k] is not equal 0
continue;
}
}
else{// if j+1 is not less than 10
direction=3;
k--;
continue;
}
break;
case 3:if(k-1>=0){
if(matrix[j][k-1]==0){
k--; // if direction=3 and matrix[j][k-1]=0
continue;
}
else{
direction=4;
j--; //if matrix[j][k-1] is not equals to zero
continue;
}
}
else{
direction=4;
j--;// k-1 is not greater than -0
continue;
}
break;
case 4:if(j-1>=0){
if(matrix[j-1][k]==0){
j--; //if direction=4 and matrix[j-1][k]=0
continue;
}
else{
k++; // if direction=4 and matrix[j-1][k]!=0
direction=1;
continue;
}
}
else{
k++; // if direction=4 but j-1 is not greater than -1
direction=1;
continue;
}
break;
}
}
printf("Matrix after snake=\n");
for(i=0;i<10;i++){ // this loop is used to print one line of matrix
for(j=0;j<10;j++){ // this loop is used to print one element of line
printf("%d\t",matrix[i][j]);
}
printf("\n");
}
return 0;
}
Output: 
PHP Program:
<?php
$i;
$j;
$k;
$l;
$direction=1;
$matrix=array();
for($i=0;$i<10;$i++){// this loop is used to access one line of matrix
for($j=0;$j<10;$j++){// this loop is used to access one element
$matrix[$i][$j]=0;
}
}
echo "Matrix before snake=";
echo "<br>";
for($i=0;$i<10;$i++){// this loop is used to access one line of matrix
for($j=0;$j<10;$j++){ // this loop is used to access one element
echo $matrix[$i][$j];
echo "����";
}
echo "<br>";
}
for($i=1,$j=0,$k=0;$i<=100;$i++){// this loop is used set pattern
$matrix[$j][$k]=$i;
switch($direction){// this switch is used to switch the direction
case 1:if($k+1<10){
if($matrix[$j][$k+1]==0){
$k++;// if direction=1 and matrix[j][k+1]=0
continue;
}
else{
$j++;// if direction=1 and matrix[j][k+1]!=0
$direction=2;
continue;
}
}
else{ //if k+1 is not smaller than 10
$j++;
$direction=2;
continue;
}
break;
case 2:if($j+1<10){
if($matrix[$j+1][$k]==0){
$j++; // if direction=2 and matrix[j+1][k]=0
continue;
}
else{
$direction=3;
$k--; //if direction=2 and matrix[j+1][k]!=0
continue;
}
}
else{
$direction=3;
$k--;// if j+1 is not smaller than 10
continue;
}
break;
case 3:if($k-1>=0){
if($matrix[$j][$k-1]==0){
$k--; // if direction=3 and matrix[j][k-1]=0
continue;
}
else{
$direction=4;
$j--; // if direction=3 and matrix[j][k-1]!=0
continue;
}
}
else{
$direction=4;
$j--; // if k-1 is not greater than -1
continue;
}
break;
case 4:if($j-1>=0){
if($matrix[$j-1][$k]==0){
$j--; // if direction=4 and matrix[j-1][k]=0
continue;
}
else{
$k++; // if direction=4 and matrix[j-1][k]!=0
$direction=1;
continue;
}
}
else{
$k++; //if j-1 is not greater than -1
$direction=1;
continue;
}
break;
}
}
echo "Matrix after snake";
echo "<br>";
for($i=0;$i<10;$i++){ // this loop is used to print one line
for($j=0;$j<10;$j++){ //this loop is used to print one element
echo $matrix[$i][$j];
echo "��";
if($matrix[$i][$j]<100){
echo "��";
}
if ($matrix[$i][$j]<10){
echo "��";
}
}
echo "<br>";
}
Output: 
Java Program:
public class pattern{
public static void main(String []args){
int matrix[][]=new int[10][10];
int i,j,k,l;
int direction=1;
for(i=0;i<10;i++){ //this loop is used to access one line of matrix
for(j=0;j<10;j++){ // this loop is used to access one element
matrix[i][j]=0;
}
}
System.out.print("Matrix before snake=\n");
for(i=0;i<10;i++){ // this loop is used to print one line of matrix
for(j=0;j<10;j++){//this loop is used to print one element of matrix
System.out.print(matrix[i][j]+"\t");
}
System.out.println("");
}
for(i=1,j=0,k=0;i<=100;i++){// this loop is used to set pattern
matrix[j][k]=i;
switch(direction){
case 1:if(k+1<10){
if(matrix[j][k+1]==0){
k++; // if direction=1 and matrix[j][k+1]=0
continue;
}
else{
j++; // if direction=1 and matrix[j][k+1]!=0
direction=2;
continue;
}
}
else{
j++; // if k+1 is not smaller than 10
direction=2;
continue;
}
case 2:if(j+1<10){
if(matrix[j+1][k]==0){
j++; //if direction=2 and matrix[j+1][k]=0
continue;
}
else{
direction=3;
k--; //if direction=2 and matrix[j+1][k]!=0
continue;
}
}
else{
direction=3;
k--; //j+1 is not smaller than 10
continue;
}
case 3:if(k-1>=0){
if(matrix[j][k-1]==0){
k--; // if direction=3 and matrix[j][k-1]=0
continue;
}
else{
direction=4;
j--; // if direction=3 and matrix[j][k-1]!=0
continue;
}
}
else{
direction=4;
j--; //k-1 is not greater than -1
continue;
}
case 4:if(j-1>=0){
if(matrix[j-1][k]==0){
j--; //if direction=4 and matrix[j-1][k]=0
continue;
}
else{
k++; //if direction=4 and matrix[j-1][k]!=0
direction=1;
continue;
}
}
else{
k++; //if j-1 is not greater than -1
direction=1;
continue;
}
}
}
System.out.println("Matrix after snake=\n");
for(i=0;i<10;i++){ //this loop is used to print one line of matrix
for(j=0;j<10;j++){ //this loop is used to print one element
System.out.print(matrix[i][j]+"\t");
}
System.out.println("");
}
}
}
Output: 
C# Program:
using System.IO;
using System;
public class Program
{
public static void Main(String[] args)
{
int[,] matrix=new int[10,10];
int i,j,k;
int direction=1;
for(i=0;i<10;i++){ // this loop is used to access one line of a matrix
for(j=0;j<10;j++){ //this loop is used to access one element
matrix[i,j]=0;
}
}
Console.WriteLine("Matrix before snake=\n");
for(i=0;i<10;i++){ // this loop is used to print one line of matrix
for(j=0;j<10;j++){ // this loop is used to print one element
Console.Write(matrix[i,j]+"\t");
}
Console.WriteLine("\n");
}
for(i=1,j=0,k=0;i<=100;i++){// this loop is used to set pattern
matrix[j,k]=i;
switch(direction){
case 1:if(k+1<10){
if(matrix[j,k+1]==0){
k++; //if direction=1 and matrix[j][k+1]=0
continue;
}
else{
j++; //if direction=1 and matrix[j][k+1]!=0
direction=2;
continue;
}
}
else{
j++; //if k+1 is not smaller than 10
direction=2;
continue;
}
case 2:if(j+1<10){
if(matrix[j+1,k]==0){
j++; //direction=2 and matrix[j+1][k]=0
continue;
}
else{
direction=3;
k--; //direction=2 and matrix[j+1][k]!=0
continue;
}
}
else{
direction=3;
k--; //j+1 is not smaller than 10
continue;
}
case 3:if(k-1>=0){
if(matrix[j,k-1]==0){
k--; // if direction=3 and matrix[j][k-1]=0
continue;
}
else{
direction=4;
j--; // if direction=3 and matrix[j][k-1]!=0
continue;
}
}
else{
direction=4;
j--; //if k-1 is not greater than -1
continue;
}
case 4:if(j-1>=0){
if(matrix[j-1,k]==0){
j--; //if direction=4 and matrix[j-1][k]=0
continue;
}
else{
k++; //if direction=4 and matrix[j-1][k]!=0
direction=1;
continue;
}
}
else{
k++; //if j-1 is not greater than -1
direction=1;
continue;
}
}
}
Console.WriteLine("Matrix after snake=\n");
for(i=0;i<10;i++){ // this loop is used to print one line
for(j=0;j<10;j++){ // this loop is used to print one element
Console.Write(matrix[i,j]+"\t");
}
Console.WriteLine("\n");
}
}
}
Output: 
Python Program:
i=0
j=0
k=1
l=1
direction=1
matrix=[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]]
print("Matrix before snake=")
i=0
while i<10: #this loop is used to print one line of matrix
j=0
while j<10: #this loop is used to print one element
print(matrix[i][j], end='', flush=True)
print(" ", end='', flush=True)
if matrix[i][j]<100:
print(" ", end='', flush=True)
if matrix[i][j]<10:
print(" ", end='', flush=True)
j=j+1
print("")
i=i+1
i=1
j=0
k=0
while i<=100: #this loop is used to set pattern
matrix[j][k]=i
if direction==1:
if k+1<10:
if matrix[j][k+1]==0:
k=k+1 #if direction=1 and matrix[j][k+1]=0
else:
j=j+1 #if direction=1 and matrix[j][k+1]!=0
direction=2
else:
j=j+1 #if k+1 is not smaller than 10
direction=2
elif direction==2:
if j+1<10:
if matrix[j+1][k]==0:
j=j+1 #if direction=2 and matrix[j+1][k]=0
else:
direction=3
k=k-1 #if direction=2 and matrix[j+1][k]!=0
else:
direction=3
k=k-1 #if j+1 is not smaller than 10
elif direction==3:
if k-1>=0:
if matrix[j][k-1]==0:
k=k-1 #if direction=3 and matrix[j][k-1]=0
else:
direction=4
j=j-1 #if direction=3 and matrix[j][k-1]!=0
else:
direction=4
j=j-1 #if k-1 is not greater than -1
elif direction==4:
if j-1>=0:
if matrix[j-1][k]==0:
j=j-1 #if direction=4 and matrix[j-1][k]=0
else:
k=k+1 #if direction=4 and matrix[j-1][k]!=0
direction=1
else:
k=k+1 #if j-1 is not greater than -1
direction=1
i=i+1
print("Matrix after snake=")
i=0
while i<10: #this loop is used to print one line
j=0
while j<10: #this loop is used to print one element
print(matrix[i][j], end='', flush=True)
print(" ", end='', flush=True)
if matrix[i][j]<100:
print(" ", end='', flush=True)
if matrix[i][j]<10:
print(" ", end='', flush=True)
j=j+1
print("")
i=i+1
Output: 
Next TopicProgram to Print the Pattern 9
|
Related Links:
- Program to determine whether a given number is an abundant number
- Program to determine whether a given number is a twisted prime number
- Program to print all abundant numbers between 1 to 100
- Program to print all Kaprekar numbers between 1 to 100
- Program to print the largest element present in an array
- Program to print the number of elements present in an array
- Program to print the smallest element present in an array
- Program to print the sum of all the elements of an array
- Program to right rotate the elements of an array
- Program to sort the elements of an array in ascending order
- Program to sort the elements of an array in descending order
- Program to Calculate The Addition of 2 Matrices
- Program to Calculate The Subtraction of 2 Matrices
- Program to Find the Longest Repeating Sequence in a String
- Program to Remove All the White Spaces from a String
- Program to Replace Lower-Case Characters with Upper-Case and Vice Versa
- Program to Replace the Spaces of a String with a Specific Character
- Program to Count the Total Number of Characters in a String
- Program To Print Pattern 3
- Program To Print Pattern 4
- Program To Print Pattern 5
- Program To Print Pattern 6
- Program To Print Pattern 7
- Program To Print Pattern 8
- Program To Print Pattern 9
- Program to Find the Smallest Element in a Binary Tree
- Program to Find the Sum of all the Nodes of a Binary Tree
- Program to Find the Total Number of Possible Binary Search Trees with N Keys
- Program to Implement Binary Tree using the Linked List
- Program to Search a Node in a Binary Tree
- Program To Create And Display A Singly Linked List
- Program To Create A Singly Linked List Of N Nodes And Count The Number Of Nodes
- Program To Create A Singly Linked List Of N Nodes And Display It In Reverse Order
- Program To Swap Nodes In A Singly Linked List Without Swapping Data
- Program To Swap The Last Element Of The Singly Linked List From The First One
- Program to Create a Circular Linked List of N Nodes and Count the Number of Nodes
- Program to Create a Circular Linked List of N Nodes and Display it in Reverse Order
- Program to Create and Display a Circular Linked List
- Program to Delete a New Node From the Beginning of the Circular Linked List
- Program to Delete a New Node From the End of the Circular Linked List
- Program to Delete a New Node From the End of the Doubly Linked List
- Program to Delete a New Node From the Middle of the Doubly Linked List
- Program to Find the Maximum and Minimum Value Node From a Doubly Linked List
- Program to Insert a New Node at the Beginning of the Doubly Linked List
- Program to Insert a New Node at the End of Doubly Linked List
- Program to Insert a New Node at the Middle of Doubly Linked List
- Program to Remove Duplicate Elements From a Doubly Linked List
- Program to Rotate Doubly Linked List by N Nodes
- Program to Delete a New Node From the Middle of the Circular Linked List
- Program to Find the Maximum and Minimum Value Node From a Circular Linked List
- Program to Insert a New Node at the Beginning of the Circular Linked List
- Program To Delete A New Node From The Beginning Of The Singly Linked List
- Program To Delete A New Node From The Middle Of The Singly Linked List
- Program to Search an Element in a Doubly Linked List
- Program to Sort the Elements of the Doubly Linked List
- Program to Determine Whether a Given Matrix is an Identity Matrix
- Program to Determine Whether a Given Matrix is a Sparse Matrix
- Program to Determine Whether Two Matrices Are Equal
- Program to Count the Total Number of Words in a String
- Program to Determine Whether a Given String is Palindrome
- Program to Determine Whether One String is a Rotation of Another
- Program to print all prime numbers between 1 to 100
- Program to print the average of n numbers
- Program to print the combination (nCr) of the given number
- Program to print the first 10 prime numbers
- Program to print the permutation (nPr) of the given number
- Program to print the sum of digits without using modulus
- Program to swap two numbers
- Program to Display The Lower Triangular Matrix
- Program to Display The Upper Triangular Matrix
- Program to Find The Frequency of Odd and Even Numbers In The Given Matrix
- Program to Find Maximum and Minimum Occurring Character in a String
- Program to Find Reverse of a String
- Program To Delete A Node From The End Of The Singly Linked List
- Program To Determine Whether A Singly Linked List Is The Palindrome
- Program to Insert a New Node at the End of the Circular Linked List
- Program to Insert a New Node at the Middle of the Circular Linked List
- Program to Remove Duplicate Elements From a Circular Linked List
- Program to Search an Element in a Circular Linked List
- Program to Sort the Elements of the Circular Linked List
- Program to Convert a Given Binary Tree to Doubly Linked List
- Program to Create a Doubly Linked List From a Ternary Tree
- Program To Insert A New Node At The Middle Of The Singly Linked List
- Program To Insert A New Node At The Beginning Of The Singly Linked List
- Program To Find The Maximum And Minimum Value Node From A Singly Linked List
- Program to Find the Largest and Smallest Word in a String
- Program to Find the Most Repeated Word in a Text File
- Program to Find The Transpose of a Given Matrix
- Program to Count the Total Number of Punctuation Characters Exists in a String
- Program to Find The Product of Two Matrices
- Program to Find The Sum of Each Row And Each Column of a Matrix
- Program to Calculate the Difference Between the Sum of the Odd Level and Even Level Nodes of a Binary Tree
- Program to swap two numbers without using the third variable
- Program to copy all the elements of one array into another array
- Program to find the frequency of each element of an array
- Program to left rotate the elements of an array
- Program to print the duplicate elements of an array
- Program to Find the Duplicate Characters in a String
- Program to Find the Duplicate Words in a String
- Program to Find the Frequency of Characters
- Program to print all Disarium numbers between 1 to 100
- Program to print all happy numbers between 1 to 100
- Program to print the elements of an array
- Program to print the elements of an array in reverse order
- Program to Count the Total Number of Vowels and Consonants in a String
- Program to Determine Whether Two Strings are The Anagram
- Program to Divide a String in 'N' Equal Parts
- Program to Find the Number of Words in the Given Text File
- Program to Print Smallest and Biggest Possible Palindrome Word in a Given String
- Program to Find Maximum Width of a Binary Tree
- Program to Find the Largest Element in a Binary Tree
- Program To Insert A New Node At The End Of The Singly Linked List
- Program To Remove Duplicate Elements From A Singly Linked List
- Program to Create a Doubly Linked List of N Nodes and Count the Number of Nodes
- Program to Create a Doubly Linked List of N Nodes and Display it in Reverse Order
- Program to Create and Display a Doubly Linked List
- Program to Delete a New Node From the Beginning of the Doubly Linked List
- Program to Separate the Individual Characters from a String
- Program to Swap two String Variables Without Using Third or Temp Variable
- Program To Print Pattern 1
- Program To Print Pattern 2
- Program to Find all the Permutations of a String
- Program to Find All Possible Subsets of a String
- Program to print the elements of an array present on even position
- Program to print the elements of an array present on odd position
- Program to Find the Maximum Depth or Height of a Tree
- Program to Find the Nodes Which are at the Maximum Distance in a Binary Tree
- Program to calculate the area of rectangle
- program to calculate the volume of sphere
- program to find the area of a Pentagon
- program to find the area of parallelogram
- program to find the area of square
- Program to calculate the CGPA percentage
- program to find the surface area of sphere
- program to find the volume of cone
- program to find the volume of cube
- Program to determine whether a given number is a happy number
- Program to determine whether a given number is a Harshad number
- program to find the volume of cylinder
- Program to convert Celsius into Fahrenheit
- Program to convert days into years
- Program to find the surface area of the cylinder
- Program to determine whether a given number is a Disarium number
- Program to convert Fahrenheit into Celsius
- Program to find the area of an equilateral triangle
- Program to find the area of the right angle triangle
- Program to find the perimeter of the rectangle
- Program to find the area of a triangle
- Program to print all Pronic numbers between 1 to 100
- Program to Determine Whether a Given Number is a Deficient Number
- Program to find the simple interest
- Program to find the surface area of a cube
- Program to find the surface area of cuboid
- Program to Print Pattern 10
- Program to Print Pattern 11
- Program To Search An Element In A Singly Linked List
- Program To Sort The Elements Of The Singly Linked List
- Program to Print Pattern 12
- Program to Print Pattern 14
- Program to Print Pattern 15
- Program to Print Pattern 13
- Program to Print Pattern 16
- Program to Determine Whether all Leaves are at Same Level
- Program to Determine Whether two Trees are Identical
- Program to Print Pattern 17
- Program to Print Pattern 19
- Program to Print Pattern 18
- Program to Construct a Binary Search Tree and Perform Deletion and Inorder Traversal
- Program to Convert Binary Tree to Binary Search Tree