Given the list of integers, 4, 3, 6, 5, 9, 8, 7, we sort this list using MergeSort. During the divide part of the algorithm, if the list is of odd length we let the left list be one shorter than the right list. Assertion: The number of comparisons made by MergeSort to sort this list in increasing order is 12.

icon
Related questions
Question

t/f

Given the list of integers, 4, 3, 6, 5, 9, 8, 7, we sort this list using MergeSort. During the divide part of
the algorithm, if the list is of odd length we let the left list be one shorter than the right list.
Assertion: The number of comparisons made by MergeSort to sort this list in increasing order is 12.
Transcribed Image Text:Given the list of integers, 4, 3, 6, 5, 9, 8, 7, we sort this list using MergeSort. During the divide part of the algorithm, if the list is of odd length we let the left list be one shorter than the right list. Assertion: The number of comparisons made by MergeSort to sort this list in increasing order is 12.
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer