# Time Complexity

# Merge sort is unique for its time in that the best, worst, and average time complexity are all the same:
# Θ(N*log(N)


# If the data is already sorted, Timsort runs in Θ(N) time
