It requires additional memory for sorting.

It sorts by comparing each pair of adjacent elements and swapping them if they are in the wrong order.

t always works in O( n log n ) time.

It uses divide and conquer technique.