The following is the pseudocode for which type of algorithm?
for start = each array subscript, from the first to the next-to-last
minindex = start
minvalue = array[start]
for index = start + 1 to size - 1
if array[index] < minvalue
minvalue = array[index]
minindex = index
end if
end for
swap array[minindex] with array[start]
end for
(a) bubble sort
(b) binary sort
(c) bubble search
(d) selection sort
(e) none of those

Selection sort

Explanation:

In selection sort for ascending sort it repeatedly goes through the list to find the minimum element and puts it in among the sorted elements.

here we are taking the first value of the array as the minimum value and we repeatedly go through the array to compare it with all the elements present in the array. When we find the smallest element it place it in the 0 index position and then continue our search from the index position 1 and continue so on till the list is sorted.