Given:
5. import java.util.*;
6. public class SortOf {
7. public static void main(String[] args) {
8. ArrayList<Integer> a = new ArrayList<Integer>();
9. a.add(1); a.add(5); a.add(3);
11. Collections.sort(a);
12. a.add(2);
13. Collections.reverse(a);
14. System.out.println(a);
15. }
16. }
What is the result?
A.
[1, 2, 3, 5]
B.
[2, 1, 3, 5]
C.
[2, 5, 3, 1]
D.
[5, 3, 2, 1]
E.
[1, 3, 5, 2]
F.
Compilation fails.
G.
An exception is thrown at runtime.
C is correct:
line 9: 1, 5, 3
line 11: 1, 3, 5 (sorted by a natural ordering)
line 12: 1, 3, 5, 2 (no TreeSet–> no auto sort)
line 13: 2, 5, 3, 1 (reversed)