Amitava mentioned in the lecture that insertion sort is faster than merge sort up until 6000 elements. However, the graph of both algorithms show that the intercept is much smaller, and insertion sort is only faster for less than 100 elements approximately. As such, what is the correct approximate input size for which insertion sort is faster than merge sort so that I may decide which to implement. Thanks.