from SelectSort import * #include everything from our SelectSort.py (must be in the same folder)
def merge_by_sort(A, B):#Not efficient, does not exploit the fact that each of A and B are sorted
""" merging two lists """
C = A + B
selection_sort(C)
return C
def merge_by_python_sort(A, B):
""" merging two lists """
return sorted(A+B)
## C = A + B
## C.sort()
## return C
def merge(A, B):
''' Merge list A of size n and list B of size m
A and B must be sorted! '''
n = len(A)
m = len(B)
C = [0 for i in range(n+m)]
a=0; b=0; c=0
while a