- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
Algorithms | Sorting | Question 23
Last Updated :
Discuss
Comments
Which of the following is true about merge sort?
Merge Sort works better than quick sort if data is accessed from slow sequential memory.
Merge Sort is stable sort by nature
Merge sort outperforms heap sort in most of the practical situations.
All of the above.
This question is part of this quiz :
Top MCQs on Sorting Algorithms with Answers,Top MCQs on QuickSort Algorithm with Answers,Top MCQs on MergeSort Algorithm with Answers,Top MCQs on HeapSort Algorithm with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy