time complexity of merge sort
O(n*Log n):
The time complexity of MergeSort is O(n*Log n) in all the 3 cases
(worst, average and best).
As the mergesort always divides the array into two halves
and takes linear time to merge two halves.time complexity of merge sort
O(n*Log n):
The time complexity of MergeSort is O(n*Log n) in all the 3 cases
(worst, average and best).
As the mergesort always divides the array into two halves
and takes linear time to merge two halves.Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
