Which of the following sorting algorithms is described by this text? "Start with the item at index 1 and see if it is in order compared to the item at index 0. If it is not, then swap it with the item at index 0. If it is not, then swap it with the item at index 0. Then see if the item at index 2 is already in order compared to the items at the lower indexes; if it is not, then swap it with the items at lower indexes; if it is not, then swap it with the items at lower indexes until it is in the correct order. Continue this process with all remaining indexes.

A. insertion sort

B. selection sort

C. merge sort

D. quick sort

E. binary sort

An array of integers is to be sorted from smallest to biggest using a selection sort. Assume the array originally contains the following elements:

11 17 30 8 20 25

What will it look like after the third pass through the for loop?

A. 8 11 17 20 25 30

B. 8 11 17 30 20 25

C. 8 17 30 11 20 25

D. 8 11 17 20 30 25

E. 8 11 30 17 20 25