In java language

PART 3

Question 12

The next three questions ask you to trace a sort.

To trace a sort, write out the contents of the array after each pass of the sort. Write each number separated by a space.

Trace an insertion sort on the following array.

27

14

23

24

19

12

20

10

What is the contents of the array after the first pass of insertion sort?

Answer:

Question 13

What is the contents of the array after the second pass of insertion sort?

Answer:

Question 14

What is the contents of the array after the third pass of insertion sort?

Answer:

Question 15

How many total passes will execute during the insertion sort?

Answer:

Question 16

What is the base case for the recursive merge sort algorithm?

Select one:

a. A one-element array.

b. Any array that is already sorted.

c. A zero-element array.

d. A two-element array.

Question 17

What is the efficiency of merge sort?

Select one:

a.O( n )

b.O(n logn)

c. O(1)

d. O(log n)

e. O(n²)

Question 18

Which of the following sorting algorithms is the fastest?

Select one:

a. Selection sort.

b. Insertion sort.

c. Merge sort.

d. They all run at roughly the same speed.

Question 19

One pass of the Quicksort's partition method is performed with the partition in index 4 (the value 50).

Could the array below be the result of one pass of partition?

index:	0	1	2	3	4	5	6	7	8
value:	3	15	7	19	50	68	92	51	72

Select one:

a. True

b. False

Question 20

One pass of the Quicksort's partition method is performed with the partition in index 4 (the value 50).

Could the array below be the result of one pass of partition?

index:	0	1	2	3	4	5	6	7	8
value:	2	14	28	62	50	48	63	77	81

Select one:

a. True

b. False