C++ Programming Question: Download C++ Programming PDF
Which recursive sorting technique always makes recursive calls to sort subarrays that are about half size of the original array?
Answer:
Mergesort always makes recursive calls to sort subarrays that are about half size of the original array, resulting in O(n log n) time.
Previous Question | Next Question |
What is friend function in C++? | What is abstraction in C++? |