QUESTION 22 When implementing merge sort it is very important that the auxiliary

Question

QUESTION 22

When implementing merge sort it is very important that the auxiliary array will be passed to the recursive method and that it won't be created inside the recursive method.

Why? Creating the auxiliary array inside the recursive method is a bad choice because__________?

A) it increases the memory usage

B) it makes the code less clear and harder to read

C) it both slows down the algorithm and increases the memory usage

D) it reduces the performance (speed) of the algorithm (wrong answer)

QUESTION 23

The first step in heap sort is to 'heapify' a given array.

Apply the algorithm that we studied in this class in order to 'heapify' the array below.

The resulting heap should be a max heap. _7 1 4 9 2 6 0 3 8 5

Explanation / Answer

When implementing merge sort it is very important that the auxiliary array will be passed to the recursive
method and that it won't be created inside the recursive method.
Creating the auxiliary array inside the recursive method is a bad choice because it makes the code less clear and harder to read

It takes the sampe auxiliary space whether you create inside recursive method or you pass in function.

Ans: B

The first step in heap sort is to 'heapify' a given array.
Apply the algorithm that we studied in this class in order to 'heapify' the array below.
The resulting heap should be a max heap. _7 1 4 9 2 6 0 3 8 5

result: 9 8 6 7 5 4 0 3 1 2

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.