MHB Why is the runtime of Merge Sort O(n log n)?

  • Thread starter Thread starter find_the_fun
  • Start date Start date
  • Tags Tags
    Runtime Sort
Click For Summary
The discussion centers on the runtime complexity of the merge sort algorithm, specifically T(n) = nb + cn log(n). The confusion arises regarding why this is classified as O(n log n). It is clarified that for sufficiently large n (n > n0, where n0 is greater than the logarithm's base), the terms can be simplified. The dominant term in the expression is cn log(n), which grows faster than nb for large n. Therefore, the overall runtime can be expressed as being bounded by a constant multiple of n log(n), confirming that merge sort operates within O(n log n) complexity due to the constants b and c not affecting the growth rate as n increases.
find_the_fun
Messages
147
Reaction score
0
For megre sort alogirthm the runtime is T(n)=nb+cnlog(n). It's not quite clear to me why this is O(nlogn) is it because b and c are constants?
 
Technology news on Phys.org
find_the_fun said:
For megre sort alogirthm the runtime is T(n)=nb+cnlog(n). It's not quite clear to me why this is O(nlogn) is it because b and c are constants?

It is because for \(n>n_0\) where \(n_0>0\) is greater than the base of the logarithm (so \( \log(n)>1\) )
:

\[|T(n)|=|n \; b+c\; n \log(n)|<|b| \; n+|c|\; n \log(n)<|b|\; n \log(n)+ |c|\; n \log(n) = A\; n \log(n)\]

CB
 
Last edited:

Similar threads

Is the Worst Runtime of This Algorithm Θ(n^2)?
  • · Replies 6 ·
Replies
6
Views
3K
Can Sorting Ever Be Done in Time Proportional to n?
  • · Replies 12 ·
Replies
12
Views
2K
Java Why use spread operator when sorting an array in JavaScript?
  • · Replies 2 ·
Replies
2
Views
2K
MHB Merging $k$ Sorted Lists with a Thin Heap: A $\mathcal{O}(n \lg k)$ Algorithm
  • · Replies 1 ·
Replies
1
Views
2K
MHB Explaining Proof of Quick-Sort's O(nlog n) Expected Running Time
  • · Replies 1 ·
Replies
1
Views
1K
C# Big O: find ##c## and ##n_0## if ##g(n)## is known
  • · Replies 1 ·
Replies
1
Views
1K
Merge sort running time O(nlogn) formula
  • · Replies 1 ·
Replies
1
Views
1K
MHB Find First Free Position in Array in $O(\log n)$ Time Complexity
  • · Replies 36 ·
2
Replies
36
Views
6K
MHB Calculating the Cost of Insertion Sort: O(n)
  • · Replies 12 ·
Replies
12
Views
4K
Complexity of this heap algorithm
  • · Replies 1 ·
Replies
1
Views
2K