Since there is no such input size where merge sort is faster than insertion sort, then based on the general time complexity of the sorting algorithms, merge sort will be the obvious solution. Is this correct? Based on the standard competition ranking,...

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 approxi...

I am unsure how the rank system works. If 10,20,20,40, then the ranks are 1,2,2,4. However, what if a get rank time(3) is provided, but there are no rank3? If get rank time(3) returns '20', then it the rank is simply the index - 1 which seems wrong.