e) Which of the following is true about merge sort? 1. Merge Sort works better than...

Transcribed Image Text:

e) Which of the following is true about merge sort? 1. Merge Sort works better than quick sort if data is accessed from slow sequential memory. 2. Merge Sort is stable sort by nature. 3. Merge sort outperforms heap sort in most of the practical situations. 4. All of the above. e) Which of the following is true about merge sort? 1. Merge Sort works better than quick sort if data is accessed from slow sequential memory. 2. Merge Sort is stable sort by nature. 3. Merge sort outperforms heap sort in most of the practical situations. 4. All of the above.

Answer rating: 100% (QA)

e4 All of the above 1True Merge sort is much more efficient than quicksort if the data to be sorted ... View the full answer