# Merger Sort

# - Merge sort is a divide and conquer algorithm
# - Divide the input array in two halves and we keep halving recursively until they
#   becom too small that cannot be broken further
# - Merge halves by sorting them

# Continue here....

c_list = [2,1,7,6,5,3,4,9,8]