The bubble sort algorithm works by

Question 11 options:

	partitioning the unsorted portion of the array into two sublists and a pivot and recursively sorting the two sublists
	repeatedly taking the first value in the unsorted portion of the array and placing it at its proper place in the part of the array that is already sorted
	repeatedly locating the smallest value in the unsorted portion of the array and moving it toward the lower end of the array
	repeatedly comparing adjacent items and swapping them so smaller values come before larger values

Save

Question 12 (3 points)

The insertion sort algorithm works by

Question 12 options:

	repeatedly taking the first value in the unsorted portion of the array and placing it at its proper place in the part of the array that is already sorted
	partitioning the unsorted portion of the array into two sublists and a pivot and recursively sorting the two sublists
	repeatedly comparing adjacent items and swapping them so smaller values come before larger values
	repeatedly locating the smallest value in the unsorted portion of the array and moving it toward the lower end of the array

Save

Question 13 (3 points)

The selection sort algorithm works by

Question 13 options:

	repeatedly locating the smallest value in the unsorted portion of the array and moving it toward the lower end of the array
	repeatedly taking the first value in the unsorted portion of the array and placing it at its proper place in the part of the array that is already sorted
	partitioning the unsorted portion of the array into two sublists and a pivot and recursively sorting the two sublists
	repeatedly comparing adjacent items and swapping them so smaller values come before larger values

Save

Question 14 (3 points)

The Quicksort algorithm works by

Question 14 options:

	repeatedly comparing adjacent items and swapping them so smaller values come before larger values
	repeatedly locating the smallest value in the unsorted portion of the array and moving it toward the lower end of the array
	partitioning the unsorted portion of the array into two sublists and a pivot and recursively sorting the two sublists
	repeatedly taking the first value in the unsorted portion of the array and placing it at its proper place in the part of the array that is already sorted

Save