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:
Merge Sort satisfies all the three options given above.
Quiz of this Question
Please comment below if you find anything wrong in the above post