Sorting Algorithms in Java

Which sorting algorithm may make multiple swaps per pass?

• Bubble Sort
• Selection Sort
• Insertion Sort

Which sorting algorithm shifts elements instead of swapping elements if needed in each pass.

• Bubble Sort
• Selection Sort
• Insertion Sort

How many passes will both the selection and insertion sorts make?

• N
• N-1
• N+1
• (N+1)/2

The following lists represent 3 passes of a sorting algorithm. Which algorithm is being used to sort the list?
 
4    5    9    6    2    7
4    5    6    2    7    9 
4    5    2    6    7    9

• Bubble Sort
• Selection Sort
• Insertion Sort

The following lists represent 3 passes of a sorting algorithm. Which algorithm is being used to sort the list?
 
4    8    6    2    5    7 
4    8    6    2    5    7 
4    6    8    2    5    7

• Bubble Sort
• Selection Sort
• Insertion Sort

The following lists represent 3 passes of a sorting algorithm. Which algorithm is being used to sort the list?
 
4    8    3    9    2    6 
2    8    3    9    4    6
2    3    8    9    4    6

• Bubble Sort
• Selection Sort
• Insertion Sort

We are sorting the following list in ascending order:
 
1    4    2    9    3    8    5
 
What does the list look like after one pass of the bubble sort algorithm. 

• 1 2 4 3 8 5 9
• 1 4 2 5 3 8 9
• 4 2 9 3 8 5 1

We are sorting the following list in descending order:
 
1    4    2    9    3    8    5
 
What does the list look like after one pass of the selection sort algorithm.

• 1 4 2 9 3 8 5
• 9 4 2 1 3 8 5
• 4 2 9 3 8 5 1

We are sorting the following list in ascending order:
 
1    4    2    9    3    8    5
 
What does the list look like after one pass of the insertion sort algorithm. 

• 1 4 2 9 3 8 5
• 4 2 9 3 8 5 1
• 4 1 2 9 3 8 5

In a(n) ____, you repeatedly compare pairs of items, swapping them if they are out of order, eventually creating a sorted list.

• range match
• bubble sort
• enhanced for loop
• A.float sort