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

Mountain Wave Pattern

Read summary with AI tools
Table of contents
  1. Output
  2. How the mountain wave 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

Three small pyramids side by side, like a mountain range. The logic is explained step by step, and the full program is given in C, C++, Java and Python.

This program is part of the Wave Patterns collection.

Mountain Wave Pattern output

Output (height 3, three mountains):

  *    *    *
 ***  ***  ***
***************
Mountain Wave Pattern layout diagram, row by row (height 3, three mountains)
How each row of the mountain wave pattern is built (height 3, three mountains). Blue cells are printed characters; grey dots are spaces.

How the mountain wave pattern works

Each mountain is 2n − 1 columns wide. (j − 1) % (2n − 1) + 1 turns the real column into a position inside the current mountain, and then the usual pyramid test decides whether to print a star.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Go through 3 × (2 × n − 1) positions in the row. Print stars where (j − 1) % (2 × n − 1) + 1 ≥ n − i + 1 and (j − 1) % (2 × n − 1) + 1 ≤ n + i − 1; print spaces everywhere else.
  3. Move to the next line.

Mountain Wave Pattern in C

#include <stdio.h>

int main(void) {
    int n = 3;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 3 * (2 * n - 1); j++) {
            if ((j - 1) % (2 * n - 1) + 1 >= n - i + 1 && (j - 1) % (2 * n - 1) + 1 <= n + i - 1)
                printf("*");
            else
                printf(" ");
        }
        printf("\n");
    }
    return 0;
}

Mountain Wave Pattern in C++

#include <iostream>
using namespace std;

int main() {
    int n = 3;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 3 * (2 * n - 1); j++) {
            if ((j - 1) % (2 * n - 1) + 1 >= n - i + 1 && (j - 1) % (2 * n - 1) + 1 <= n + i - 1)
                cout << "*";
            else
                cout << " ";
        }
        cout << endl;
    }
    return 0;
}

Mountain Wave Pattern in Java

public class MountainWave {
    public static void main(String[] args) {
        int n = 3;

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= 3 * (2 * n - 1); j++) {
                if ((j - 1) % (2 * n - 1) + 1 >= n - i + 1 && (j - 1) % (2 * n - 1) + 1 <= n + i - 1)
                    System.out.print("*");
                else
                    System.out.print(" ");
            }
            System.out.println();
        }
    }
}

Mountain Wave Pattern in Python

n = 3

for i in range(1, n + 1):
    for j in range(1, 3 * (2 * n - 1) + 1):
        if (j - 1) % (2 * n - 1) + 1 >= n - i + 1 and (j - 1) % (2 * n - 1) + 1 <= n + i - 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).

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.