If the right element is larger than the left element.

If the left element is greater than the right element.

If the left and right elements are equal.

If the left element is less than the right element.

O(log n)

O(n^2)

O( n )

O( 1 )

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.

O(log n)

O(n^2)

O( n log n )

O( n )