What is the space complexity of the Merge Sort algorithm ?

2025

What is the space complexity of the Merge Sort algorithm ?

  1. A.

    O(1)

  2. B.

    O(n)

  3. C.

    O(log n)

  4. D.

    O(n log n)

Attempted by 153 students.

Show answer & explanation

Correct answer: B

Merge Sort creates temporary arrays during the merge process, requiring space proportional to the input size.

Explore the full course: Tpsc Assistant Technical Officer