Question: Consider the following algorithm: for (i = 1; i = 1; i--) System.out.print( + i); When n = 2, how many times the number 3
Consider the following algorithm:
for (i = 1; i <= 1.5 * n; i++) System.out.print( + i); for (i = n; i >= 1; i--) System.out.print( + i);
When n = 2, how many times the number 3 appears in the output?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
