Bummer! This is just a preview. You need to be signed in with an account to view the entire instruction.


Merge Sort Implementations

Note: If code is not provided below in the language you are looking for, send an email to <content+cs@teamtreehouse.com>


# Let&#39;s define a recursive merge sort function. As usual, it takes the
# list or sub-list that we want it to sort.
def merge_sort(values):
  # Our base case is the same as with Quicksort. If the list has zero or one
  # values, there&#39;s nothing...