The two diagonals of a square, forming the letter X. This tutorial shows the output, a row-by-row diagram and the complete program in C, C++, Java and Python.
This program is part of the Symbol Patterns collection.
X Pattern output
Output (n = 5):
* *
* *
*
* *
* *
How the x pattern works
A cell is on the main diagonal when i = j and on the other diagonal when i + j = n + 1.
- Run the outer loop for
ifrom1ton, one row per pass. - Go through
npositions in the row. Print stars wherei = j or i + j = n + 1; print spaces everywhere else. - Move to the next line.
X Pattern in C
#include <stdio.h>
int main(void) {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == j || i + j == n + 1)
printf("* ");
else
printf(" ");
}
printf("\n");
}
return 0;
}X Pattern in C++
#include <iostream>
using namespace std;
int main() {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == j || i + j == n + 1)
cout << "* ";
else
cout << " ";
}
cout << endl;
}
return 0;
}X Pattern in Java
public class XCrossPattern {
public static void main(String[] args) {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == j || i + j == n + 1)
System.out.print("* ");
else
System.out.print(" ");
}
System.out.println();
}
}
}X Pattern in Python
n = 5
for i in range(1, n + 1):
for j in range(1, n + 1):
if i == j or i + j == n + 1:
print("* ", end="")
else:
print(" ", 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).





