Assume we want to sort integers into ascending order. To sort a small array that contains 42, 17, selection sort will perform one swap, or three assignments. How many assignments will it perform to sort an array that contains these 10 elements: 9, 8, 7, 6, 5, 4, 3, 2, 1, 0? a) 15
b) 18
c) 24
d) 27
e) 63

a) 15

Explanation:

Since we are given a list that contains 10  elements

To start with the first iteration:

We substitute element 9 with the least number in the list. In the list 0 is the least number, so by swapping it with 9 we have the list as:

For the second iteration:

we substitute element 8 with the minimum number in the list, Now the minimum number is 1, so by swapping it with 8 we have the list as:

For the third iteration:

we substitute element 7 with the minimum number in the list, Now the minimum number is 2, so by swapping it with 7 we have the list as:

For the fourth iteration:

we substitute element 6 with the minimum number in the list, Now the minimum number is 3, so by swapping it with 6 we have the list as:

For the fifth iteration:

we substitute element 5 with the minimum number in the list, Now the minimum number is 4, so by swapping it with 5 we have the list as:

At this point, the array is completely sorted and there is no more room for swapping

Thus, the number of swaps required = 5

The no. of assignment required = 3 × 5

The no. of assignment required = 15

answer; i believe that the correct answer is (calculated field);

no backup memory