Question

Can we further modify merge sort algorithm to imporve its running time

Answer 1

HEY!!

HERE IS YOUR ANSWER  :-

Overall time complexity of Merge sort is O(nLogn). It is more efficient as it is in worst case also the runtime is O(nlogn). We can cut the running time of mergesort substantially with some carefully considered modifications to the implementation

MARK AS BRAINLIST IF HLPED ^_^