Mergesort always makes recursive calls to sort subarrays that are about half size of the original array, resulting in 0(n log n) time.
02:10
AtoZ C++ Interview Questions, AtoZ CPP Objective Type Questions, AtoZ C++ Study Material
No comments
0 comments:
Post a Comment