Merge Sort uses the divide-and-conquer approach. The array is divided into log n levels, and merging at each level takes O(n), resulting in an overall complexity of O(n log n).
What is the overall time complexity of the merge sort algorithm?
Review the verified answer and explanation for this MOD - MINISTRY OF DEFENCE past-paper question on CampusFin.
Question context
This question is part of ⚡ Electrical Engineering within the broader 🛠️ Engineering Essentials subject and appears in the MOD - MINISTRY OF DEFENCE preparation collection. Reviewing the answer together with nearby questions helps reinforce the underlying concept and identify how it may appear in competitive exams.