Alternating Binary Number Triangle (Starting with 1) in C#

Beginner
⏱️ 8 min read
📚 Updated: Aug 2026
🎯 3 Code Examples
🚀 Live Preview
Modulo Operator
Alternating binary number triangle starting with 1 (1, 10, 101, 1010, 10101) in C# programming
Overview

What You’ll Learn

The alternating binary number triangle with an ascending inner loop prints each row starting with 1 and alternating 0/1 as width grows. This tutorial covers the shape rule, loop structure, a live preview, algorithm steps, worked C# examples, edge cases, and complexity.

Shape Rule

j % 2 alternates 0 and 1

Row 1 prints 1, row 2 prints 10, row 3 prints 101, and so on as width grows.

Outer Loop

Rows

for (i = 1; i <= rows; i++) makes each new row one digit longer than the previous.

Inner Loop

1..i ascending

for (j = 1; j <= i; j++) prints j % 2 while counting up, so every row starts with 1.

Write vs WriteLine

Same line / next line

Binary digits use Console.Write(j % 2); end each row with WriteLine().

Live Preview

1–20 rows

Pick a row count and draw the ascending-inner binary triangle instantly in the browser.

O(n²)

Complexity

Total digit prints still = n(n+1)/2; extra memory stays O(1).

Introduction

An alternating binary number triangle (starting with 1) grows each row by one digit while alternating between 0 and 1 using the modulo operator. With rows = 5, the output is 1, 10, 101, 1010, 10101.

In C# you solve it with an ascending outer loop and an ascending inner loop: for (j = 1; j <= i; j++) prints j % 2, then Console.WriteLine() ends each row.

Why it matters?

It is a natural follow-up to Program 15 — same modulo idea, different inner-loop direction.

Key Highlights

Modulo Alternation

j % 2 yields 0 for even j, 1 for odd j.

Ascending Inner Loop

j = 1 up to i makes every row start with 1.

Write Then Break

Write(j % 2) in the inner loop; WriteLine() after.

Series Foundation

Follow Program 15 (descending inner); continue to Program 17 (left-shifted odd numbers).

In short: for each row i from 1 to rows, print j % 2 for j from 1 up to i, then call Console.WriteLine().

Foundation

📝 Problem & Approach

Given a positive integer rows, print an alternating binary number triangle starting with 1: row i has i digits from j % 2 as j counts up from 1 to i.

C#
// rows = 5 (conceptual shape)
// 1
// 10
// 101
// 1010
// 10101

Inputs & Outputs

ItemTypeDescription
rowsintNumber of triangle lines to print (typically ≥ 1).
Printed outputtextEach row has i alternating binary digits from j % 2.

Minimal workflow

Pseudocode
for i from 1 to rows:
    for j from 1 to i:
        print j % 2 (no newline)
    print newline

Approach comparison

ApproachIdeaBest for
Ascending inner + j % 21, 10, 101, …Learning and interviews
Flip with 1 - (j % 2)Start rows with 0 instead of 1Parity inversion variant
Program 15 variantDescending inner loopProduces 1, 01, 101, …
Cheat Sheet

⚡ Quick Reference

GoalPattern
Walk each rowfor (i = 1; i <= rows; i++)
Print binary digitfor (j = 1; j <= i; j++) Console.Write(j % 2);
End the rowConsole.WriteLine();
Flip parityConsole.Write(1 - (j % 2));
Program 15 variantfor (j = i; j >= 1; j--) Console.Write(j % 2) (descending inner)
Row + column parityConsole.Write((i + j) % 2);
Compare

📋 Ascending Inner vs Descending Inner vs Flip

Same binary triangle family — inner-loop direction changes the row shape.

j % 2
parity

Even j → 0, odd j → 1

1 - (j % 2)
flipped

Inverts every digit — row 1 starts with 0

j up to i
asc inner

This page — produces 1, 10, 101, …

Learning tip
compare 15

Try Program 15’s descending inner loop next

Context

When This Pattern Shows Up

Reach for this pattern when teaching the modulo operator inside nested loops.

  1. First lab exercise

    Natural follow-up after Program 15 — same modulo, different inner-loop direction.

  2. Nested-loop warm-up

    Outer/inner bound practice with an immediate visual check.

  3. Console I/O practice

    Combine loops with ReadLine for a flexible row count.

  4. Gateway to variants

    Compare Program 15 (descending inner loop) and Program 17 (left-shifted odd numbers) next.

  5. Not a UI layout tool

    This is a console teaching pattern — not how you build modern app screens.

Key benefit: one small program that locks in nested loops, output sequencing, and O(n²) thinking.

Interactive

🔮 Live Preview

Choose a row count between 1 and 20 and draw the alternating binary triangle in the browser.

Try 5, 7, or 10. Larger values still work up to 20.

Live result
Press "Draw pattern".
Hands-On

Examples Gallery

Three complete C# programs — fixed row count, flip-to-zero variant, and user-input version. Click View Output to reveal sample console results.

📚 Getting Started

Print five rows of the ascending-inner binary triangle with j % 2.

Example 1 — Fixed rows = 5

Hard-coded height — ideal for first demos and screenshots.

C#
using System;

namespace MyApp
{
    class Program
    {
        static void Main(string[] args)
        {
            int rows = 5;
            int i, j;

            for (i = 1; i <= rows; i++)
            {
                for (j = 1; j <= i; j++)
                {
                    Console.Write(j % 2);
                }
                Console.WriteLine();
            }
        }
    }
}

How It Works

When i = 1, the inner loop prints 1 % 2 = 1. When i = 3, it prints 1%2=1, 2%2=0, 3%2=1 as 101, and so on as row width grows. WriteLine() after the inner loop starts the next row.

📈 Flip Variant

Invert parity so the first row starts with 0 instead of 1.

Example 2 — Flip with 1 - (j % 2)

Start each row with 0 instead of 1 by inverting the parity output.

C#
using System;

namespace MyApp
{
    class Program
    {
        static void Main(string[] args)
        {
            int rows = 5;

            for (int i = 1; i <= rows; i++)
            {
                for (int j = 1; j <= i; j++)
                {
                    Console.Write(1 - (j % 2));
                }
                Console.WriteLine();
            }
        }
    }
}

How It Works

1 - (j % 2) flips every digit: where j % 2 was 1 it prints 0, and vice versa. Row 1 becomes 0 instead of 1.

⚡ User Input

Read the row count at runtime and scale the binary triangle.

Example 3 — User Input Version

Read rows from the console and apply the same j % 2 logic.

C#
using System;

namespace MyApp
{
    class Program
    {
        static void Main(string[] args)
        {
            int rows;
            int i, j;

            Console.Write("Enter the number of rows: ");
            rows = Convert.ToInt32(Console.ReadLine());

            for (i = 1; i <= rows; i++)
            {
                for (j = 1; j <= i; j++)
                {
                    Console.Write(j % 2);
                }
                Console.WriteLine();
            }
        }
    }
}

How It Works

Same nested-loop core as Example 1; only the source of rows changes. Non-numeric input will throw with Convert.ToInt32 — switch to TryParse for safer labs.

🧠 How the Algorithm Prints Rows

1

Set up

using System; brings in Console. Set rows (fixed or from input).

Setup
2

Outer loop (row length)

for (i = 1; i <= rows; i++) makes each row one digit longer than the previous.

Row
3

Inner loop (modulo)

for (j = 1; j <= i; j++) prints j % 2 with Console.Write to alternate 0 and 1.

Binary
4

New line

Console.WriteLine() ends the row so the next outer iteration starts fresh.

Break
=

Binary triangle complete

Total digit prints: 1+2+…+n = n(n+1)/2 — O(n²) time, O(1) extra memory.

Trace

🔎 Worked Walkthrough — rows = 4

Trace each outer-loop value of i and note the j % 2 values printed as j counts up.

iInner j orderj % 2 valuesPrinted row
1111
21, 21, 010
31, 2, 31, 0, 1101
41, 2, 3, 41, 0, 1, 01010

Total digit prints: 1 + 2 + 3 + 4 = 10 = 4×5/2.

Use Cases

Where this tiny pattern (and its loop structure) shows up beyond the homework prompt.

1. Teaching Nested Loops

Clearest visual proof that outer and inner bounds interact.

Example: change j <= i and watch the shape change.

2. Pattern Series Base

Foundation for inverted, pyramid, diamond, and hollow variants.

Example: use (i + j) % 2 for row+column parity grids.

3. Console Formatting Drills

Practice Write vs WriteLine without complex math.

Example: put WriteLine inside the inner loop by mistake.

4. Character Substitution

Swap digits for letters, stars, or spaced output once the loop works.

Example: print j + " " for spaced digits on each row.

5. Complexity Intuition

Triangular totals make O(n²) concrete for beginners.

Example: count printed digits for n = 10 still → 55.

6. Input Validation Labs

Pair the pattern with TryParse and positive-row checks.

Example: reject rows <= 0 and re-prompt.

Pro Tip: when an interviewer asks for patterns, explain the outer/inner roles first — then write the loops. The story matters as much as the code.

Advantages

Why this pattern earns a permanent spot in beginner C# courses.

  1. 1. Instant Visual Feedback

    Wrong bounds show up immediately as a broken staircase.

  2. 2. Minimal Concepts

    Only loops and console output — no arrays or math libraries.

  3. 3. Easy to Extend

    Invert, center, hollow, or change the fill character with small edits.

  4. 4. O(1) Extra Memory

    Streaming output needs no storage beyond loop counters.

Pro Tip: learn ascending inner loop first; compare with Program 15’s descending inner loop to see how direction changes each row.

Usage Tips

Small habits that keep number-pattern code clean.

  1. 1. Name Bounds Clearly

    Use rows (or n) and keep i/j for row/column — or rename to row/col.

  2. 2. Prefer TryParse

    Avoid crashes when the user types letters instead of a number.

  3. 3. Keep WriteLine Outside

    Only call WriteLine() after the inner loop finishes the row.

  4. 4. Compare with Program 15

    Run both pages with the same rows to see how inner-loop direction changes output.

  5. 5. Dry-Run One Small n

    Trace rows = 5 on paper before coding larger demos.

Pro Tip: if the output is a vertical list of single digits per line, you almost certainly put WriteLine inside the inner loop.

Common Pitfalls

Mistakes that commonly break alternating binary number patterns.

  1. 1. WriteLine Inside the Inner Loop

    Each digit lands on its own line — you get a column, not a triangle.

    → Use Write(j % 2) for binary digits; WriteLine only after the inner loop.

  2. 2. Wrong Inner Direction

    Counting j down instead of up produces Program 15’s shape (01 on row 2).

    → For this shape, keep for (j = 1; j <= i; j++).

  3. 3. Forgetting the Row Break

    Omitting WriteLine() glues every digit onto one endless line.

    → Always end the row after the inner loop.

  4. 4. Blind Convert.ToInt32

    Letters or empty input throw FormatException.

    → Prefer int.TryParse and re-prompt on failure.

  5. 5. Off-by-One on 0-Based Loops

    Switching to i = 0 without adjusting the inner bound prints an empty first row or wrong counts.

    → If 0-based, print i with wrong inner bound (e.g. j <= i + 1).

Edge Cases

Check these inputs before calling the solution done.

rows = 1

Single digit

Output is just 1 on one line.

rows = 0

Empty pattern

Outer loop never runs — print nothing or show a message.

Negative

rows < 0

Treat as invalid; re-prompt instead of silent empty output.

Large n

Many rows

Output grows as n²/2 characters — fine for labs, noisy for huge n.

Bad input

Non-numeric ReadLine

Convert.ToInt32 throws — use TryParse.

Fill char

Forgot modulo

Write(j) prints 1,2,3… — use Write(j % 2) for binary output.

Drill

🎯 Practice Problems

Try these variations to lock in the pattern.

1. Descending inner binary triangle

  • Inner loop j = i down to 1
  • Continue with Program 15

2. Left-shifted odd number triangle

  • Outer loop steps by 2 with odd digits
  • Continue with Program 17

3. Flip parity

  • Use 1 - (j % 2) so row 1 starts with 0
  • Compare output with Example 2

4. Row+column parity

  • Use Console.Write((i + j) % 2) for a checkerboard-style grid
  • Harder follow-up after this page
Important

Notes

  • Triangular sum. Digit prints for rows 1+2+3+…+n still grow as O(n²) for n rows.
  • Console.Write stays on the line; WriteLine advances — mix them carefully.
  • Validate rows > 0 for interactive programs; rows = 1 should print a single 1.
  • This page is left-aligned. Centered pyramids need leading spaces — covered later in the series.

Quick Takeaway: outer loop grows row length, inner loop prints j % 2 ascending, then break the line.

Analysis

⏱️ Time and Space Complexity

ProgramTimeExtra space
Nested loops (Examples 1–2)O(rows²)O(1)
User input (Example 3)O(rows²)O(1)
Wrap Up

🎉 Conclusion

The alternating binary number triangle with an ascending inner loop is a compact lesson in how loop direction changes output. Master the j % 2 version, then compare with Program 15’s descending inner loop.

Practice the three examples above, then continue to Program 17 for the left-shifted odd number triangle.

Use for (j = 1; j <= i; j++) with Write(j % 2) — keep WriteLine for the break, and validate row counts when reading input.

View Examples Gallery Continue to Program 17
Pro Tips

💡 Best Practices

✅ Do

  • Explain ascending inner loop j = 1..i before coding
  • Use Console.Write(j % 2) for digits and WriteLine after each row
  • Validate rows ≥ 1 for interactive programs
  • Prefer int.TryParse over bare Convert.ToInt32
  • State O(n²) time when asked about complexity

❌ Don’t

  • Call WriteLine inside the inner digit loop
  • Print Write(j) instead of Write(j % 2)
  • Count j down when you meant this page’s ascending inner loop
  • Skip the newline after each row
  • Ignore bad console input in user-facing demos
  • Skip the rows = 1 edge case
Summary

Key Takeaways

Knowledge Unlocked

Five things to remember about this ascending-inner pattern

Print the pattern the beginner-friendly way.

5
Core concepts
△ 01

Rule

j % 2 alternates 0 and 1

Definition
↻ 02

Inner loop

Counts j up to i

Code
% 03

Modulo

j % 2 picks digit

Logic
↵ 04

WriteLine

Ends each row

I/O
O 05

Complexity

O(n²) time

Analysis
🎯 You’re ready to print an ascending-inner binary number triangle in C#
Review Quick Reference →

❓ Frequently Asked Questions

Modulo 2 returns the remainder after dividing by 2. Any integer is either even (remainder 0) or odd (remainder 1).
On row 2, the inner loop prints j = 1 then j = 2. That becomes 1 % 2 = 1 then 2 % 2 = 0, so the row is 10.
Console.Write stays on the same line. Console.WriteLine ends the current line. Binary digits use Write(j % 2); the row break uses WriteLine after the inner loop.
Row 3 prints j = 1, 2, 3 and j % 2 becomes 1, 0, 1 — concatenated as 101.
Program 16 counts the inner loop up (j = 1 to i) producing 1, 10, 101, 1010, 10101. Program 15 counts down (j = i to 1) producing 1, 01, 101, 0101, 10101.
Yes. Print 1 - (j % 2) instead of j % 2 to flip every digit — first row becomes 0 instead of 1.
Yes. Toggle a variable between 0 and 1 on each print, but modulo is the simplest approach for this pattern.
O(n²) where n is the number of rows. Total Console.Write calls equal n+(n-1)+…+1 = n(n+1)/2.
Prefer int.TryParse(Console.ReadLine(), out rows) so bad input does not throw FormatException.
The outer loop never runs, so nothing is printed. Validate and prompt again if you want a clear user message.

Did you Know? 🔊

Each row prints alternating 0 and 1 using j % 2. The inner loop counts up from 1 to i, so every row starts with 1 — still O(n²) total prints.

Continue to Program 17

Move on to the left-shifted odd number triangle in the C# number-pattern series.

Program 17 tutorial →

About the author

Mari Selvan M P
Mari Selvan M P 🔗

Developer, cloud engineer, and technical writer

  • Experience 12 years building web and cloud systems
  • Focus Full Stack Development, AWS, and Developer Education

I write practical tutorials so students and working developers can learn by doing—from databases and APIs to deployment on AWS.

AWS Certified Developer – Associate (Credly)

12 people found this page helpful

C# Number Pattern 15 C# Number Pattern 17