算法题

用Python实现效果

请手写归并排序算法，并且用注释写出思路，并且指出时间复杂度

def mergesort(a,b):
    c = []
    len1 = len(a)
    len2 = len(b)
    j,i = 0, 0
    while i < len1 and j < len2:
        if a[i] > b[j]:
            c.append(b[j])
            j += 1
        else:
            c.append(a[i])
            i += 1
    while i < len1:
        c.append(a[i])
        i += 1
    while j < len2:
        c.append(b[j])
        j += 1
    return c


def separateList(q, first, last):
    if first < last:
        mid = int((first + last)/2)
        separateList(q, first, mid)
        separateList(q, mid+1, last)
        a = q[first:mid+1]
        b = q[mid+1:last+1]
        c = mergesort(a, b)
        start = first
        for i in c:
            q[start] = i
            start += 1
        return q

有四个数字：1、2、3、4，能组成多少个互不相同且无重复数字的三位数？

def random_number(number):
    w = 0
    for i in range(1, number):
        for n in range(1, number):
            for m in range(1, number):
                if i != n and n != m and i != m:
                    print("{}{}{}".format(i, n, m))
                    w += 1
    print("total:{}".format(w))

单链表反转

def reverse_list(list_input):
    relist=[]
    for i in range (len(list_input)):
        relist.append(list_input.pop())
    return relist

给定 n 个非负整数 a1，a2，…，an，每个数代表坐标中的一个点 (i, ai) 。