Recursion Contest

1234

4321

12344321

43211234

Many digits are printed due to infinite recursion.

words.remove(0);

printRightToLeft(words);

words.remove(words.size());

printRightToLeft(words);

words.remove(words.size() - 1);

printRightToLeft(words);

printRightToLeft(words);

words.remove(0);

printRightToLeft(words);

words.remove(words.size() - 1);

int val = maximum(data, start);

int val = maximum(data, start - 1);

int val = maximum(data, start + 1);

int val = maximum(data[start - 1], start);

int val = maximum(data[start + 1], start);

The variable total should be initialized to 1.

The variable x should be initialized to 0.

The condition in the while loop header should be x < n - 1.

The condition in the while loop header should be x <= n.

No change is required; the methods, as currently written, return the same values when they are called with the same positive integer parameter n.

I only

II only

III only

II and III only

I, II, and III

1

3

4

5

7

-1

5

6

7

8

1

2

3

4

5

1

2

3

4

5

1

11

17

18

No value is returned because mystery throws an ArrayIndexOutOfBoundsException.