Can sort the item to insert list in O(n log log n) Progressive Sort If a swap was needed, it increases the gap by 1 Otherwise, the gap is decreased by 1 Best Case: O(n) Average Case: O(n log n) Worst Case: O(n^2) In-place: Yes Stable: No
