What Is The Worst Case Time Complexity Of Merge Sort? * Code Example


Example: 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.

Comments

Popular posts from this blog

AspenTech InfoPlus 21 - How To Connect And Query Data

Chemistry - Bond Angles In NH3 And NCl3

Can Not Use Command Telnet In Git Bash