CS4GATE

Algorithms / Sorting

Merge Sort's worst-case space complexity is?

MCQ 2023 Merge Sort

Merge Sort's worst-case space complexity is?

Choose an Option

Answer

O(n)

Theory

Merge Sort needs auxiliary memory equal to the input size for the merge step.

Solution

Auxiliary array of size n ⇒ O(n) extra space.

Open Interactive Question All Questions

Previous QuestionThe average-case time complexity of Quick Sort is?Algorithms / Quick Sort Next QuestionDijkstra's algorithm fails when the graph has?Algorithms / Dijkstra's Algorithm

Practice More From This Topic

The average-case time complexity of Quick Sort is?Algorithms / Quick Sort / 2022

More Algorithms Questions

The average-case time complexity of Quick Sort is?Algorithms / Quick Sort / 2022 Dijkstra's algorithm fails when the graph has?Algorithms / Dijkstra's Algorithm / 2023 Time complexity of 0/1 Knapsack via DP with n items and capacity W?Algorithms / 0/1 Knapsack / 2024 Given activities with start/end times, the greedy strategy that maximizes the number of activities selects activities sorted by which attribute? (1 = start time, 2 = end time)Algorithms / Activity Selection / 2022

Keep practicing

Want filters, bookmarks, progress, quiz, and mock tests?

Read questions freely here, or sign in to continue with dashboard practice and paid test tools.

Start Free View Paid Plan