Which recursive sorting technique always makes recursive calls to sort subarrays that are about half size of the original array?

Q

Which recursive sorting technique always makes recursive calls to sort subarrays that are about half size of the original array?

✍: Guest

A

Mergesort always makes recursive calls to sort subarrays that are about half size of the original array, resulting in O(n log n) time.

2012-02-21, 2582👍, 0💬