This algorithm begins by sorting the first two elements of the array, which become a sorted subset. Then, the third element is moved to its correct position relative to the first two elements. At that...

This algorithm begins by sorting the first two elements of the array, which become

a sorted subset. Then, the third element is moved to its correct position relative to

the first two elements. At that point, the first three elements become the sorted

subset. This process continues with the fourth and subsequent elements until the

entire array is sorted.

a. bubble sort

b. selection sort

c. insertion sort

d. sequential sort