What is the complexity of a mergesort algorithm?
Share
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Please Disable the AdBlocker to Continue to the site.
The complexity of mergesort is O(n log n), indicating that the running time increases proportionally to the logarithm of the input size ‘n’.