# If the time complexity of mergesort is O(n log n) and insertion sort is O(n^2) where n is the input size, how much faster is mergesort?

Follow

1 answer
1

Are you sure you want to delete this answer?