Sorting Algorithms Quiz

1. Which algorithm uses divide and conquer by splitting the list and then merging?

• A) Bubble sort
• B) Merge sort
• C) Insertion sort
• D) Selection sort

Answer: Merge sort splits the data set in half and merges it back together.

2. Which algorithm inserts each item into its correct position one at a time?

• A) Bubble sort
• B) Merge sort
• C) Insertion sort
• D) Quick sort

Answer: Insertion sort builds a sorted list one item at a time.

3. Which algorithm compares adjacent items and swaps them if they are out of order?

• A) Bubble sort
• B) Merge sort
• C) Insertion sort
• D) Heap sort

Answer: Bubble sort swaps adjacent items to move the largest/smallest item along.

4. Which statement best fits merge sort?

• A) Best for inserting into an already sorted list
• B) The most inefficient but easy to implement
• C) Compares adjacent items and swaps them
• D) Works very well for large data sets

Answer: Merge sort is efficient and works well for large data sets.

5. Which statement best fits insertion sort?

• A) Finishes when no more swaps are needed
• B) Useful for inserting items into a sorted list
• C) Splits lists in half repeatedly
• D) Always completes in one pass

Answer: Insertion sort is particularly useful for inserting into a sorted list.

6. Which statement best fits bubble sort?

• A) Works very well for large data sets
• B) Inserts each item into the correct position
• C) Easy to implement but inefficient
• D) Uses divide and conquer

Answer: Bubble sort is very easy to implement but inefficient.