6. 17pts] Given a properly implemented merge sort algorithm and the list [5, 3, 7, 8,...

Transcribed Image Text:

6. 17pts] Given a properly implemented merge sort algorithm and the list [5, 3, 7, 8, 9, 11] is it possible for the merge sort algorithm to eventually have to merge the following two lists? Why or why not? [5, 3, 7] [8, 9, 11] 7. [20pts] Draw a diagram that illustrates how the merge sort algorithm would sort this list. Draw the contents of the list after each splitting and merging step of the algorithm: [2, -3, 45, 10, -45, 100, 1000] 6. 17pts] Given a properly implemented merge sort algorithm and the list [5, 3, 7, 8, 9, 11] is it possible for the merge sort algorithm to eventually have to merge the following two lists? Why or why not? [5, 3, 7] [8, 9, 11] 7. [20pts] Draw a diagram that illustrates how the merge sort algorithm would sort this list. Draw the contents of the list after each splitting and merging step of the algorithm: [2, -3, 45, 10, -45, 100, 1000]

Answer rating: 100% (QA)

The diagram you sent shows the merge sort algorithm sorting the list 5 3 7 8 9 11 10 12 45 10 45 100 ... View the full answer