×

Multiple-Choice Questions

Web Technologies MCQs

Computer Science Subjects MCQs

Databases MCQs

Programming MCQs

Testing Software MCQs

Digital Marketing Subjects MCQs

Cloud Computing Softwares MCQs

AI/ML Subjects MCQs

Engineering Subjects MCQs

Office Related Programs MCQs

Management MCQs

More

Which of the following is a disadvantage of the Merge Sort algorithm?

3. Which of the following is a disadvantage of the Merge Sort algorithm?

  1. It is not stable.
  2. It has a worst-case time complexity of O(n^2).
  3. It is not an in-place sorting algorithm.
  4. It cannot handle large datasets.

Answer

The correct answer is: C) It is not an in-place sorting algorithm.

Explanation

Merge Sort requires additional memory to store the merged subarrays. So, it is not an in-place sorting algorithm.

Comments and Discussions!

Load comments ↻






Copyright © 2024 www.includehelp.com. All rights reserved.