New: 77 pattern programs with tested code in C, C++, Java and Python Explore patterns

Butterfly Star Pattern

Read summary with AI tools
Table of contents
  1. Output
  2. How the butterfly star pattern works
  3. Program in C
  4. Program in C++
  5. Program in Java
  6. Program in Python
  7. Time and space complexity
  8. Related patterns

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):

*        *
**      **
***    ***
****  ****
**********
**********
****  ****
***    ***
**      **
*        *
Butterfly Star Pattern layout diagram, row by row (n = 5)
How each row of the butterfly star pattern is built (n = 5). Blue cells are printed characters; grey dots are spaces.

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.

  1. Run the outer loop for i from 1 to n, one row per pass (upper wings).
  2. Go through 2 × n positions in the row. Print stars where j ≤ i or j > 2 × n − i; print spaces everywhere else.
  3. Move to the next line.
  4. Run the outer loop for i from n down to 1, one row per pass (lower wings).
  5. Go through 2 × n positions in the row. Print stars where j ≤ i or j > 2 × n − i; print spaces everywhere else.
  6. 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).

Authored by

Ghanendra Yadav runs Pattern Programs from Bangalore, India. The site started in 2020 to help students practise loops and logic through pattern programs in C, C++, Java and Python. Every program published here is compiled and run before it goes live, and the output shown is the real output.

Latest articles

Leave a comment

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.