KnowraMerge sortLinked fromLinked fromThe 12 pages that link to Merge sort, each with the reason it gives.All 12Broader topic 8Compared with 4AlgorithmBroader topic: It shows how recursive decomposition can yield predictable sorting performance.Big O notationBroader topic: Its running time illustrates a common n log n bound.RecursionBroader topic: It demonstrates recursion with independent subproblems and a combining step.Time complexityBroader topic: Its O(n log n) running time exemplifies divide-and-conquer analysis.Analysis of algorithmsBroader topic: Its recurrence yields a worst-case running time proportional to n log n.Divide-and-conquer algorithmBroader topic: It exemplifies balanced splitting followed by a linear-time merge.Sorting algorithmBroader topic: Its merge step combines sorted parts while preserving a predictable time bound.Master theoremBroader topic: Its recurrence T(n)=2T(n/2)+Θ(n) falls in the theorem's balanced-work case.