Skip to content
Related Articles

Related Articles

Algorithms | Sorting | Question 23

View Discussion
Improve Article
Save Article
  • Last Updated : 28 Jun, 2021
View Discussion
Improve Article
Save Article

Which of the following is true about merge sort?
(A) Merge Sort works better than quick sort if data is accessed from slow sequential memory.
(B) Merge Sort is stable sort by nature
(C) Merge sort outperforms heap sort in most of the practical situations.
(D) All of the above.


Answer: (D)

Explanation: See Merge Sort and this.


Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!