Question

Which statement is correct? (Note: Our selectionsort picks largest items first.) A. The algorithm might be either selectionsort or insertionsort. B. The algorithm might be selectionsort, but could not be insertionsort. C. The algorithm might be insertionsort, but could not be selectionsort. D. The algorithm is neither selectionsort nor insertionsort.

Answer 1

The statement which is correct:

c. The algorithm might be insertion sort, but could not be selection sort.

Step-by-step explanation:

Selection sort:

In data structure, such a sorting technique in which the smallest element from the unsorted array is swapped with the left-most element. So, the first digit is always the smallest.

Insertion Sort:

In data structure, such a sorting technique in which each element is compared with all other elements of the array.

• As our selection sort picks the largest items first so it can't be selection but can be insertion sort as insertion sort the largest item can come on the first position.