L

You have the following ist

list$\_$of$\_$numbers $=|4,-22,3,1,4,12,-34,7,9|$

Your ultimate goat is to use marge sort algorithm to sort the numbers in the list:

While doing that, draw the shope of list for eachistep to display divide ond merge steps as in the figure at the end of the hitts:$//$www$.$khanacademy.org$/$computing$/$computer$-$science$/$algotithms$/$mergesort$/$a$/$overview$-$ot$-$merge$-$sort page of the text book.

b$.$ Suppose that we have a worst case sceriario for sorting the numbers:

What does "worst case scenario" mean for sorting?

li$.$ What is the worst$-$case running time for merge sort? compare it with selection sort insertion sort and quicksort. Which one:ls the best?