Skip to content
Related Articles

Related Articles

Algorithms | Sorting | Question 23
  • Last Updated : 27 Aug, 2013

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

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :