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

0-1 (Binary) Triangle

Read summary with AI tools
Table of contents
  1. 0-1 Triangle output
  2. How the 0-1 triangle works
  3. 0-1 Triangle in C
  4. 0-1 Triangle in C++
  5. 0-1 Triangle in Java
  6. 0-1 Triangle in Python
  7. Time and space complexity
  8. Related patterns

A right triangle of alternating 1s and 0s. 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.

0-1 Triangle output

Output (n = 5):

1
0 1
1 0 1
0 1 0 1
1 0 1 0 1
0-1 Triangle layout diagram, row by row (n = 5)
How each row of the 0-1 triangle is built (n = 5). Blue cells are printed characters; grey dots are spaces.

How the 0-1 triangle works

(i + j + 1) % 2 flips between 1 and 0 as j increases, and each new row starts with the opposite digit to the row above.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Print i numbers (value (i + j + 1) % 2).
  3. Move to the next line.

0-1 Triangle in C

#include <stdio.h>

int main(void) {
    int n = 5;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++)
            printf("%d ", (i + j + 1) % 2);
        printf("\n");
    }
    return 0;
}

0-1 Triangle in C++

#include <iostream>
using namespace std;

int main() {
    int n = 5;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++)
            cout << ((i + j + 1) % 2) << " ";
        cout << endl;
    }
    return 0;
}

0-1 Triangle in Java

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

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++)
                System.out.print(((i + j + 1) % 2) + " ");
            System.out.println();
        }
    }
}

0-1 Triangle in Python

n = 5

for i in range(1, n + 1):
    for j in range(1, i + 1):
        print((i + j + 1) % 2, 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.