In the textbook, we determined that the merge method requires a total of 5n visits. We found that the number of visits required to sort an array of n elements is T(n) = T(n / 2) + T(n / 2) + 5n. What does T(n / 2) describe?
A) the total number of visits to merge sort an array of n elements
B) half the number of visits to merge sort an array of n elements
C) the total number of visits to merge sort an array of n / 2 elements
D) half the number of visits to merge sort an array of n / 2 elements

Question

Quizplus · Accepted Answer

T(n / 2) describes the total number of visits to merge sort an array of n / 2 elements, as it represents the recursive call to sort each half of the array.

In the Textbook, We Determined That the Merge Method Requires