It will increment the gap to 2 to check for further insertion, but then decrement back to 1 in the next item. Progressive Sort 2 and Progressive Sort 3 would behave the same way. O(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
