CS 222 Study guide

If the array is already sorted, which algorithm will perform best?

• insertion sort

• selection sort

• merge sort

• quicksort

• All will take same amount of time

If the array is sorted in reverse order, which algorithm will perform best?

• insertion sort

• selection sort

• merge sort

• quicksort

• All will take same amount of time

If the array contents are randomly shuffled, which algorithm will most likely perform best?

• insertion sort

• selection sort

• merge sort

• quicksort

• All will take same amount of time

Say we have a class C, which has a private field F and public method M. Can M directly access F?

• Yes

• No

Say we have a class C. C has a public field F and package-visible method M. Can M directly access F?

• Yes

• No

Say we have a class C1, which has a public field F. We have another class C2, which has a method M. Can M directly access F?

• Yes

• No

Say we have a class C1, which has a private field F. We have another class C2, which has a method M. Can M directly access F?

• Yes

• No

A priority queue is used by the compiler to handle recursion.

• True

• False

A stack is used by the compiler to handle recursion.

• True

• False

A linked list is used by the compiler to handle recursion.

• True

• False