Recursion · AP Computer Science A

AP Computer Science A Quiz

8 questions · no time limit

0:00

DATA COLLECTIONS

Question 1 of 8

No time limit

Current

Answered

Flagged

Not seen

How many recursive calls are made by hanoi(3, "A", "B", "C") before all moves print?

void hanoi(int n, String from, String aux, String to) {
  if (n == 1) { print(from + "->" + to); return; } // base case
  hanoi(n-1, from, to, aux);                        // recursive case
  print(from + "->" + to);
  hanoi(n-1, aux, from, to);
}
```

YOUR PROGRESS

QUESTIONS

Ready when you are

Answer in any order. Your progress shows here as you go.

QUESTIONS

KEYBOARD

Pick an answer ABCD

Next question ↵→

Flag for review F