What is the time complexity of Merge Sort for sorting an array of size “n”?

Bihar STET · PGT (Paper 2) · Computer Science · 2025

What is the time complexity of Merge Sort for sorting an array of size “n”?

  1. A.

    O(n)

  2. B.

    O(log n)

  3. C.

    O(n log n)

  4. D.

    O(n2)

Attempted by 1004 students.

Show answer

Correct answer: C

The worked solution is available to enrolled students.

Explore the full course: Bihar Stet Paper Ii Computer Science

Loading lesson…