Data Structure Introduction → Time Complexity → MCQ Details
MCQ Practice Single Best Answer Topic: Time Complexity

Q How is the time complexity of the merge sort algorithm characterized?

Question ID
#21511
Subchapter
Time Complexity
Action
Choose one option below

Choose Your Answer

Click an option to check whether your answer is correct.

  • A O(N) ✔ ✖
  • B O(log N) ✔ ✖
  • C O(N^2) ✔ ✖
  • D O(N log N) ✔ ✖
Correct Answer: D

Explanation

Merge sort has a time complexity of O(N log N), making it a stable and efficient sorting algorithm.

Related Topics

Explore more questions from similar topics.

About DSA Algorithm Design Techniques Space Complexity Time Complexity Various Data structures Various Data structures operations What is Algorithm? What is Data Structure

Share This Question

Share this MCQ with your friends or study group.