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”?
- A.
O(n)
- B.
O(log n)
- C.
O(n log n)
- D.
O(n2)
Attempted by 1004 students.
Show answer
Correct answer: C
Explore the full course: Bihar Stet Paper Ii Computer Science
Loading lesson…