Time complexity O(log N)

Has two stages: recursive partition of data elements into parts and merge of data elements.

Time complexity O(N log N)

One element is selected and other elements are placed to the left or right of that element.

Uses auxiliary memory.

Sorting performance time depends on the selection of gap.