Question

Consider the following function: 1 void asterisksPrinter(int i) { 2 if (i > 1) { 3 asterisksPrinter(i / 2); 4 asterisksPrinter(i / 2); 5 } 6 System.out.print("*"); 7} How many asterisks are printed by the method call asterisksPrinter(3)? (Either write a number, or write "infinite recursion".)

          Consider the following function:
1 void asterisksPrinter(int i) {
2
if (i > 1) {
3
asterisksPrinter(i / 2);
4
asterisksPrinter(i / 2);
5
}
6
System.out.print("*");
7}
How many asterisks are printed by the method call asterisksPrinter(3)?
(Either write a number, or write "infinite recursion".)

Consider the following function:
1 void asterisksPrinter(int i)
2
if (i > 1)
3
asterisksPrinter(i / 2);
4
asterisksPrinter(i / 2);
5

6
System.out.print("*");
7
How many asterisks are printed by the method call asterisksPrinter(3)?
(Either write a number, or write "infinite recursion".)

Added by Francisca H.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Aaron Goree

Step 1

This function is a recursive function that prints asterisks. The base condition for stopping the recursion is when `i` is no longer greater than 1. If `i` is greater than 1, the function calls itself twice with the argument `i / 2`. Show more…

Show all steps

Thanks for your feedback!

Consider the following function: void asterisksPrinter(int i) { if (i > 1) { asterisksPrinter(i / 2); asterisksPrinter(i / 2); } System.out.print("*"); } How many asterisks are printed by the method call asterisksPrinter(3)? (Either write a number, or write "infinite recursion".)