Answers for "best case complexity of merge sort"

C

8

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.

Posted by: Guest on May-30-2021

Code answers related to "best case complexity of merge sort"

Code answers related to "C"

Browse Popular Code Answers by Language

Python

Javascript

Whatever

Shell/Bash

CSS

Html

PHP

SQL

Java

C#