Question

[5 marks] Using selection sort algorithm to sort the array int array[7]-5, 6, 2, 7, 9, 4, 3). Assuming we call the following function using statement selection sort (int array, 7); Please fill the table to show the changes of the array int_array after each iteration. The first column is filled. void selection_sort (int list[], int list_size) for (int i = 0; i < list size - 1; 1++) int current min = list[1]; int current_min_index-i for (int j - i+ 1; jlist size; j++) if (current min > list[j]) Current_min - 1ist [] Current min index- i if (Currentminindex-i) - - list [Currentminindex] = list[i]; list[i] -current min; - -

Answer 1

Answer:

Selection sort is a sorting technique in which we select the minimum element from the array repeatedly from unsorted part and putting it at begning.

So, Rule or step for finding the minimum element and sorting them as follows:

1) Select the lowest element in the remaining array

2.) Bring it to the starting position

3.)change the counter for unsorted array by one