Shape Rule
j % 2 alternates 0 and 1
Row 1 prints 1, row 2 prints 01, row 3 prints 101, and so on as width grows.

The alternating binary number triangle combines nested loops with the modulo operator to print 0 and 1 in an alternating sequence. This tutorial covers the shape rule, loop structure, a live preview, algorithm steps, worked PHP examples, edge cases, and complexity.
j % 2 alternates 0 and 1
Row 1 prints 1, row 2 prints 01, row 3 prints 101, and so on as width grows.
Rows
for ($i = 1; $i <= $rows; $i++) makes each new row one digit longer than the previous.
i..1 descending
for ($j = $i; $j >= 1; $j--) prints $j % 2 while counting down, creating the alternating binary row.
Same line / next line
Binary digits use echo $j % 2; end each row with echo PHP_EOL.
1–20 rows
Pick a row count and draw the alternating binary triangle instantly in the browser.
Complexity
Total digit prints still = n(n+1)/2; extra memory stays O(1).
An alternating binary number triangle grows each row by one digit while alternating between 0 and 1 using the modulo operator. With rows = 5, the output is 1, 01, 101, 0101, 10101.
In PHP you solve it with an ascending outer loop and a descending inner loop: for ($j = $i; $j >= 1; $j--) prints $j % 2, then echo PHP_EOL; ends each row.
It is a fun way to practice parity and nested loops before more complex logic-heavy patterns.
j % 2 yields 0 for even j, 1 for odd j.
j = i down to 1 sets digit order on each row.
echo $j % 2 in the inner loop; echo PHP_EOL after.
Follow Program 14; continue to Program 16 (ascending inner loop).
In short: for each row i from 1 to rows, print j % 2 for j from i down to 1, then call echo PHP_EOL.
Given a positive integer rows, print an alternating binary number triangle: row i has i digits from j % 2 as j counts down from i to 1.
// rows = 5 (conceptual shape)
// 1
// 01
// 101
// 0101
// 10101 | Item | Type | Description |
|---|---|---|
rows | int | Number of triangle lines to print (typically ≥ 1). |
| Printed output | text | Each row has i alternating binary digits from j % 2. |
for i from 1 to rows:
for j from i down to 1:
print j % 2 (no newline)
print newline | Approach | Idea | Best for |
|---|---|---|
Descending inner + j % 2 | 1, 01, 101, … | Learning and interviews |
Flip with 1 - (j % 2) | Start rows with 0 instead of 1 | Parity inversion variant |
| Goal | Pattern |
|---|---|
| Walk each row | for ($i = 1; $i <= $rows; $i++) |
| Print binary digit | for ($j = $i; $j >= 1; $j--) echo $j % 2; |
| End the row | echo PHP_EOL; |
| Flip parity | echo 1 - ($j % 2); |
| Program 16 variant | for ($j = 1; $j <= $i; $j++) echo $j % 2 (ascending inner) |
| Row + column parity | echo ($i + $j) % 2; |
Same binary triangle family — different ways to emit 0 and 1.
parityEven j → 0, odd j → 1
flippedInverts every digit — row 1 starts with 0
desc innerThis page — produces 1, 01, 101, …
% 2 firstMaster j % 2 before row+column parity
Reach for this pattern when teaching the modulo operator inside nested loops.
Most PHP pattern series start here before pyramids and diamonds.
Outer/inner bound practice with an immediate visual check.
Combine loops with fgets(STDIN) for a flexible row count.
Compare Program 14 (odd-length rows) and Program 16 (ascending inner loop) next.
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.
Choose a row count between 1 and 20 and draw the alternating binary triangle in the browser.
Three complete PHP programs — fixed rows, a flip variant, and a user-input version. Click View Output to reveal sample console results.
Print five rows of the alternating binary triangle with j % 2.
rows = 5Hard-coded height — ideal for first demos and screenshots.
<?php
$rows = 5;
for ($i = 1; $i <= $rows; $i++) {
for ($j = $i; $j >= 1; $j--) {
echo $j % 2;
}
echo PHP_EOL;
} When i = 1, the inner loop prints 1 % 2 = 1. When i = 3, it prints 3%2=1, 2%2=0, 1%2=1 as 101, and so on as row width grows. echo PHP_EOL after the inner loop starts the next row.
Invert parity so the first row starts with 0 instead of 1.
1 - (j % 2)Start each row with 0 instead of 1 by inverting the parity output.
<?php
$rows = 5;
for ($i = 1; $i <= $rows; $i++) {
for ($j = $i; $j >= 1; $j--) {
echo 1 - ($j % 2);
}
echo PHP_EOL;
} 1 - (j % 2) flips every digit: where j % 2 was 1 it prints 0, and vice versa. Row 1 becomes 0 instead of 1.
Read the row count at runtime and scale the binary triangle.
Read $rows with (int) trim(fgets(STDIN)) and apply the same $j % 2 logic.
<?php
echo "Enter the number of rows: ";
$rows = (int) trim(fgets(STDIN));
for ($i = 1; $i <= $rows; $i++) {
for ($j = $i; $j >= 1; $j--) {
echo $j % 2;
}
echo PHP_EOL;
} Same nested-loop core as Example 1; only the source of rows changes. Non-numeric input leaves rows unset if you skip is_numeric() checks — always check it in safer labs.
Set $rows = 5; and use fgets(STDIN) when reading input. Set rows (fixed or from input).
for ($i = 1; $i <= $rows; $i++) makes each row one digit longer than the previous.
for ($j = $i; $j >= 1; $j--) prints $j % 2 with echo to alternate 0 and 1.
echo PHP_EOL ends the row so the next outer iteration starts fresh.
Total digit prints: 1+2+…+n = n(n+1)/2 — O(n²) time, O(1) extra memory.
rows = 4Trace each outer-loop value of i and note the j % 2 values printed on each row.
i | Inner j order | j % 2 values | Printed row |
|---|---|---|---|
1 | 1 | 1 | 1 |
2 | 2, 1 | 0, 1 | 01 |
3 | 3, 2, 1 | 1, 0, 1 | 101 |
4 | 4, 3, 2, 1 | 0, 1, 0, 1 | 0101 |
Total digit prints: 1 + 2 + 3 + 4 = 10 = 4×5/2.
Where this tiny pattern (and its loop structure) shows up beyond the homework prompt.
Clearest visual proof that outer and inner bounds interact.
Example: change j <= i and watch the shape change.
Foundation for inverted, pyramid, diamond, and hollow variants.
Example: use (i + j) % 2 for row+column parity grids.
Practice echo vs PHP_EOL without complex math.
Example: put echo PHP_EOL inside the inner loop by mistake.
Swap digits for letters, stars, or spaced output once the loop works.
Example: print j + " " for spaced digits on each row.
Triangular totals make O(n²) concrete for beginners.
Example: count printed digits for n = 10 still → 55.
Pair the pattern with fgets(STDIN) and is_numeric() checks 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.
Why this pattern earns a permanent spot in beginner C courses.
Wrong bounds show up immediately as a broken staircase.
Only loops and console output — no arrays or math libraries.
Invert, center, hollow, or change the fill character with small edits.
Streaming output needs no storage beyond loop counters.
Pro Tip: learn j % 2 first; compare with 1 - (j % 2) to flip every digit on each row.
Small habits that keep number-pattern code clean.
Use rows (or n) and keep i/j for row/column — or rename to row/col.
Call is_numeric(trim($line)) so bad input does not leave rows uninitialized.
Only call echo PHP_EOL after the inner loop finishes the row.
Write the j values and their modulo before coding — catches direction mistakes early.
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 echo PHP_EOL inside the inner loop.
Mistakes that commonly break alternating binary number patterns.
Each digit lands on its own line — you get a column, not a triangle.
→ Use echo $j % 2 for binary digits; echo PHP_EOL only after the inner loop.
Counting j up instead of down changes row ordering (see Program 16).
→ For this shape, keep for ($j = $i; $j >= 1; $j--).
Omitting echo PHP_EOL glues every digit onto one endless line.
→ Always end the row after the inner loop.
Letters or empty input leave rows uninitialized.
→ Prefer is_numeric() and re-prompt on failure.
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).
Check these inputs before calling the solution done.
Output is just 1 on one line.
Outer loop never runs — print nothing or show a message.
rows < 0Treat as invalid; re-prompt instead of silent empty output.
Output grows as n²/2 characters — fine for labs, noisy for huge n.
Unchecked fgets(STDIN) leaves rows unset — call is_numeric(trim($line)) first.
echo $j prints 1,2,3… — use echo $j % 2 for binary output.
Try these variations to lock in the pattern.
i -= 2 for odd widths onlyj = 1 to i instead of down1 - (j % 2) so row 1 starts with 0echo $j % 2 between digitsn rows.echo $j % 2 stays on the line; echo PHP_EOL advances — mix them carefully.rows > 0 for interactive programs; rows = 1 should print a single 1.Quick Takeaway: outer loop grows row length, inner loop prints j % 2 descending, then break the line.
| Program | Time | Extra space |
|---|---|---|
| Nested loops (Examples 1–2) | O(rows²) | O(1) |
| User input (Example 3) | O(rows²) | O(1) |
The alternating binary number triangle is a compact lesson in modulo inside nested loops. Master the j % 2 version, then try the flip variant with 1 - (j % 2).
Practice the three examples above, then continue to Program 16 for the ascending-inner-loop binary triangle.
Use $j % 2 for alternating 0/1 — keep echo for digits and echo PHP_EOL; for the break, and validate row counts when reading input.
j % 2 before coding descending inner loopecho $j % 2 for digits and echo PHP_EOL after each rowrows ≥ 1 for interactive programsis_numeric(trim($line)) before using rowsecho PHP_EOL inside the inner digit loopj directly instead of j % 2j up when you meant this page’s descending inner looprows = 1 edge casePrint the pattern the beginner-friendly way.
j % 2 alternates 0 and 1
DefinitionGrows row length each line
Codej % 2 picks digit
LogicEnds each row
I/OO(n²) time
AnalysisEach row prints alternating 0 and 1 using $j % 2. The inner loop counts down from $i to 1, so row length grows each line — still O(n²) total prints.
Move on to the column-wise alternating binary pattern in the PHP number-pattern series.
12 people found this page helpful