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


Implementing Merge Sort on Linked Lists

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


def merge_sort(linked_list):
    Sorts a linked list in ascending order
    - Recursively divide the linked list into sublists containing a single node
    - Repeatedly merge the sublists to produce sorted sublists until one ...