Simple Mergesort

mergesort.py

#!/usr/bin/python


def merge(l):
    # Base case
    if len(l) < 2:
        return l
    
    mid = len(l) // 2
    y = merge(l[:mid])
    z = merge(l[mid:])
    result = []

    while (len(y) > 0) and (len(z) > 0):
        if y[0] > z[0]:
            result.append(z[0])
            z.pop(0)
        else:
            result.append(y[0])
            y.pop(0)

    result += y
    result += z
    
    return result


if __name__ == "__main__":
    input_string = input('Type here: ')
    l = [int(x) for x in input_string] 
    output = merge(l)
    print(output)

User input functionality only supports a sequence of single digits, although this is easily modifiable as needed.