Which of the following sorting algorithms is described by this text? "Find the smallest item in the array and swap it wi

[answerhappygod]

Which of the following sorting algorithms is described by this
text? "Find the smallest item in the array and swap it with the
item currently in index 0. Then, find the smallest remaining item,
and swap it with the value at index 1. Continue this process until
all items are placed into the array in the correct
order."
a
Insertion sort
b
Heap sort
c
Merge sort
d
Quick sort
e
Selection sort