Insertion sort requires no more (h-1)(k-1) comparisons per item to sort array that is h- and k-sorted • Or (h-1)(k-1)/g comparisons to carry a g-sort

Question

i cannot understand this its about shell sort

Answer 1

Insertion sort and shell sort are 2 different sorts, but related.

SHell sort functions a little bit like insertion sort, but works with EVERY nth element

rather than consecutive elements

I would recommend watching videos about sorting algorithms