Bubble Sort Algorithm Quiz

Which sorting algorithm is more efficient than Selection Sort?

• Insertion Sort

• Quick Sort

• Merge Sort

• Bubble Sort

How does sorting work? Consider the "Flights to Indianapolis" example.

• scanning an array of data

• manually picking out outliers

• creating a table to organize data

• generating a list of data to move into groups

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

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

What is the primary operation performed in the bubble sort algorithm?

• Inserting elements

• Merging elements

• Swapping adjacent elements

• Dividing the array

What is the purpose of the boolean variable 'isSwapped' in the bubble sort algorithm?

• To store the sorted elements

• To track the number of iterations

• To count the number of elements

• To check if any swaps occurred in an iteration

How many times does the outer loop run for an array of 5 elements in bubble sort?

• 4 times

• 5 times

• 6 times

• 3 times

During the first iteration, which element is guaranteed to be in its correct position?

• The smallest element

• The middle element

• The second largest element

• The largest element

What is the role of the temporary variable during a swap in bubble sort?

• To hold one of the values being swapped

• To store the entire array

• To store the index of the largest element

• To count the number of swaps

What happens to the unsorted portion of the array with each pass in bubble sort?

• It decreases

• It increases

• It doubles

• It remains the same

Why does the inner loop's range decrease with each iteration of the outer loop?

• To increase the number of comparisons

• To exclude already sorted elements

• To include more elements

• To reset the array