python_data_scien/poc2/poc2_mini_proj_2.py
def merge_sort(list1):
    """
    Sort the elements of list1.

    Return a new sorted list with the same elements as list1.

    This function should be recursive.
    """
    if len(list1) == 1:
        return list1
    elif len(list1) == 0:
        return []
    else:
        part1_list1 = list1[:len(list1)/2]
        part2_list1 = list1[len(list1)/2:]
        sort1_list1 = merge_sort(part1_list1)
        sort2_list1 = merge_sort(part2_list1)
        return merge(sort1_list1,sort2_list1)

    Sort the elements of list1.

    Return a new sorted list with the same elements as list1.

    This function should be recursive.
    
Sort the elements of list1.
Return a new sorted list with the same elements as list1.

This function should be recursive.
Sort the elements of list1 . Return a new sorted list with the same elements as list1 . This function should be recursive .
def merge_sort(list1):
    if len(list1) == 1:
        return list1
    elif len(list1) == 0:
        return []
    else:
        part1_list1 = list1[:len(list1)/2]
        part2_list1 = list1[len(list1)/2:]
        sort1_list1 = merge_sort(part1_list1)
        sort2_list1 = merge_sort(part2_list1)
        return merge(sort1_list1,sort2_list1)
def merge_sort ( list1 ) : if len ( list1 ) == 1 : return list1 elif len ( list1 ) == 0 : return [ ] else : part1_list1 = list1 [ : len ( list1 ) / 2 ] part2_list1 = list1 [ len ( list1 ) / 2 : ] sort1_list1 = merge_sort ( part1_list1 ) sort2_list1 = merge_sort ( part2_list1 ) return merge ( sort1_list1 , sort2_list1 )
Sort the elements of list1.
Sort the elements of list1 .
"""
    Sort the elements of list1.

    Return a new sorted list with the same elements as list1.

    This function should be recursive.
    """
list1