10

25

15

5

It doesn’t require additional memory

It is fast for large datasets

It has a time complexity of O( n log n )

It works well for small arrays or nearly sorted arrays

O( log n )

O( n )

O( n^2 )

O( 1 )

It requires extra space

It is stable

It is non-comparative

It is not stable

The subarray from index 0 to i

The first element

The last element

The subarray from index i+1 to n

It will take O(log n) time.

It will take O( 1 ) time.

It will take O(n^2) time.

It will take O( n ) time if an optimization flag is used.