Has two stages: elements recursively are divided into two parts, then parts are merged in sorted way.

Uses insertion sort as subroutine.

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

Uses quick sort as subroutine.

Uses auxiliary memory.

Sorting performance time depends on the selection of gap.

Moves elements along many positions towards its sorted position.