Two right triangles facing each other, mirrored top and bottom, like butterfly wings. 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 Tricky Patterns collection.
Butterfly Star Pattern output
Output (n = 5):
* * ** ** *** *** **** **** ********** ********** **** **** *** *** ** ** * *

How the butterfly star pattern works
Each row is 2n wide. A star is printed on the left when j ≤ i and on the right when j > 2n − i. Running the same row logic again with i counting down draws the lower wings.
- Run the outer loop for
ifrom1ton, one row per pass (upper wings). - Go through
2 × npositions in the row. Print stars wherej ≤ i or j > 2 × n − i; print spaces everywhere else. - Move to the next line.
- Run the outer loop for
ifromndown to1, one row per pass (lower wings). - Go through
2 × npositions in the row. Print stars wherej ≤ i or j > 2 × n − i; print spaces everywhere else. - Move to the next line.
Butterfly Star Pattern in C
#include <stdio.h>
int main(void) {
int n = 5;
// upper wings
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 2 * n; j++) {
if (j <= i || j > 2 * n - i)
printf("*");
else
printf(" ");
}
printf("\n");
}
// lower wings
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= 2 * n; j++) {
if (j <= i || j > 2 * n - i)
printf("*");
else
printf(" ");
}
printf("\n");
}
return 0;
}Butterfly Star Pattern in C++
#include <iostream>
using namespace std;
int main() {
int n = 5;
// upper wings
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 2 * n; j++) {
if (j <= i || j > 2 * n - i)
cout << "*";
else
cout << " ";
}
cout << endl;
}
// lower wings
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= 2 * n; j++) {
if (j <= i || j > 2 * n - i)
cout << "*";
else
cout << " ";
}
cout << endl;
}
return 0;
}Butterfly Star Pattern in Java
public class ButterflyStar {
public static void main(String[] args) {
int n = 5;
// upper wings
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 2 * n; j++) {
if (j <= i || j > 2 * n - i)
System.out.print("*");
else
System.out.print(" ");
}
System.out.println();
}
// lower wings
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= 2 * n; j++) {
if (j <= i || j > 2 * n - i)
System.out.print("*");
else
System.out.print(" ");
}
System.out.println();
}
}
}Butterfly Star Pattern in Python
n = 5
# upper wings
for i in range(1, n + 1):
for j in range(1, 2 * n + 1):
if j <= i or j > 2 * n - i:
print("*", end="")
else:
print(" ", end="")
print()
# lower wings
for i in range(n, 0, -1):
for j in range(1, 2 * n + 1):
if j <= i or j > 2 * n - i:
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).





