223k views
3 votes
Assume that the elements in a long list of integers are roughly sorted in decreasing order. No more than 5 percent of the elements are out of order. Which of the following is a valid reason for using an insertion sort rather than a selection sort to sort this list in decreasing order. I. There will be fewer comparisons of elements for an insertion sort. II. There will be less space required for an insertion sort. III. Insertion sort guarantees there will be fewer changes in the position of elements.

User Davidhtien
by
3.6k points

1 Answer

3 votes

Answer:

I. There will be fewer comparisons of elements for an insertion sort.

Step-by-step explanation:

The elements in a long list of integers are roughly sorted in decreasing order then there will be fewer comparisons of elements for an insertion sort.

User Rayudu
by
4.2k points