排序算法

TimSort算法分析
https://www.cnblogs.com/brucecloud/p/6085703.html

排序算法——（2）Python实现十大常用排序算法
https://www.cnblogs.com/pig66/p/10598141.html

归并排序中的有序数组合并：

class Solution:
    """
    @param A: sorted integer array A
    @param B: sorted integer array B
    @return: A new sorted integer array
    """
    def mergeSortedArray(self, A, B):
        # write your code here
        result = []
        while len(A) > 0 and len(B) > 0:
            if A[0] < B[0]:
                result.append(A.pop(0))
            else:
                result.append(B.pop(0))
        print(result,A,B)  
        result += A
        
        result += B
        return result