O( n logn ), with the primary operation being partitioning.

O( n² ), with the primary operation being swapping adjacent elements.

O( n logn ), with the primary operation being merging two sorted halves.

O( n²  ), with the primary operation being finding the minimum element in the unsorted portion.

O( n ), with the primary operation being comparing elements.