Vandhana S.

asked • 04/19/17

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

i cannot understand this its about shell sort

1 Expert Answer

By:

Still looking for help? Get the right answer, fast.

Ask a question for free

Get a free answer to a quick problem.
Most questions answered within 4 hours.

OR

Find an Online Tutor Now

Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.