Numbers 1 to n² run left to right on odd rows and right to left on even rows, like a snake. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.
This program is part of the Wave Patterns collection.
Snake Number Pattern output
Output (n = 4):
1 2 3 4 8 7 6 5 9 10 11 12 16 15 14 13

How the snake number pattern works
On odd rows the value is (i − 1)·n + j. On even rows the row is reversed, so the value is i·n − j + 1.
- Run the outer loop for
ifrom1ton, one row per pass. - Go through
npositions in the row. Print numbers (value(i − 1) × n + j) wherei % 2 = 1; print numbers (valuei × n − j + 1) everywhere else. - Move to the next line.
Snake Number Pattern in C
#include <stdio.h>
int main(void) {
int n = 4;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i % 2 == 1)
printf("%3d", (i - 1) * n + j);
else
printf("%3d", i * n - j + 1);
}
printf("\n");
}
return 0;
}Snake Number Pattern in C++
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int n = 4;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i % 2 == 1)
cout << setw(3) << (i - 1) * n + j;
else
cout << setw(3) << i * n - j + 1;
}
cout << endl;
}
return 0;
}Snake Number Pattern in Java
public class SnakeNumberWave {
public static void main(String[] args) {
int n = 4;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i % 2 == 1)
System.out.printf("%3d", (i - 1) * n + j);
else
System.out.printf("%3d", i * n - j + 1);
}
System.out.println();
}
}
}Snake Number Pattern in Python
n = 4
for i in range(1, n + 1):
for j in range(1, n + 1):
if i % 2 == 1:
print(f"{(i - 1) * n + j:3d}", end="")
else:
print(f"{i * n - j + 1:3d}", end="")
print()Time and space complexity
The program prints one character for each position in the pattern, so for n rows it runs in O(n²) time. It only needs a few loop variables, so the extra memory is O(1).





