Question

Shell sort works by

Group of answer choices

using insertion sort on subarrays of equally spaced entries

using insertion sort on subarrays of equal size consecutive entries

iteratively searching for the smallest entry in subarrays of equally spaced entries

iteratively searching for the smallest entry in subarrays of equal size consecutive entries

Chapter 15:  Shell sort can be improved by

Group of answer choices

you cannot improve the algorithm’s time efficiency

using selection sort instead of insertion sort as the final step

alternating insertion sort and selection sort each iteration

adding 1 to the space when it is even

Which sorting algorithm is generally the slowest for a large number of items?

Group of answer choices

insertion sort

shell sort

they are all the same

selection sort

A sorting algorithm that does not change the relative order of objects that are equal is called

Group of answer choices

stable

relative

completed

ordered

Answer 1

`Hey,

Note: If you have any queries related to the answer please do comment. I would be very happy to resolve all your queries.

1) OPTION B IS CORRECT

2) OPTION C IS CORRECT

3) OPTION A IS CORRECT

4) OPTION A IS CORRECT

Kindly revert for any queries

Thanks.