Question 1

The method sort(int[] items), in class java.util.Arrays, sorts the array item in ascending order.

Accepted Answer

A) True 
 B)False

Question 2

Insertion sort is an example of a(n) ____________________ sorting algorithm.

Accepted Answer

The answer of Insertion sort is an example of a(n)...

Question 3

In merge sort, the total effort to reconstruct the sorted array through merging is ____.

Accepted Answer

A)  O(1) 
B)  O(log2n) 
C)  O(n log n) 
D)  O(n2) 
A)  O(1) 
B)  O(log2n) 
C)  O(n log n) 
D)  O(n2)

Question 4

The best sorting algorithms provide ____ average-case behavior and are considerably faster for large arrays.

Accepted Answer

A)  O(1) 
B)  O(n) 
C)  O(n2) 
D)  O(n log n) 
A)  O(1) 
B)  O(n) 
C)  O(n2) 
D)  O(n log n)

Question 5

The improvement of Shell sort over insertion sort is much more significant for small arrays.

Accepted Answer

A) True 
 B)False

The method sort(int[] items), in class java.util.Arrays, sorts the array item in ascending order.

Insertion sort is an example of a(n) ____________________ sorting algorithm.