Bummer! This is just a preview. You need to be signed in with an account to view the entire instruction.
# Let's define a recursive merge sort function. As usual, it takes the
# list or sub-list that we want it to sort.
# Our base case is the same as with Quicksort. If the list has zero or one
# values, there's nothing to sort, so we return it as-is.
if len(values) <= 1:
# If we didn't return, it means we're in the re...