Tree Printout with 29 elements

This algorithm is essentially a map function which, given an output line number, determines the array index to be output on that line, and what row to put it in.

The bit highlighted in red is the bit that was set in the last increment (i.e. n AND NOT (n - 1), where n is the current line number). Note how its position relates to which row that line is placed into.

The bits highlighted in black are the bits to the left (more significant) of the red bit, and represent the row index.

The array index is calculated by adding the row base to the row index. The row base is 2^(n-1) - 1, where n is the row number.

In the included implementation of this algorithm, rows are differentiated by tab (\t) characters.