Shell sort can be considered as an improvement of insertion sort based on two reasons: 1) Insertion sort is efficient if the input is "almost sorted". 2) Insertion sort is typically inefficient because it moves values just one position at a time.
Shell sort can be considered as an improvement of insertion sort based on two reasons: 1) Insertion sort is efficient if the input is "almost sorted". 2) Insertion sort is typically inefficient because it moves values just one position at a time.