Exploring Searching and Sorting Algorithms

Which sorting algorithm repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order?

• Merge sort

• Bubble sort

• Binary search

• Insertion sort

What is the main advantage of merge sort over bubble sort?

• Merge sort is easier to understand

• Merge sort is generally faster for large lists

• Merge sort uses less memory

• Merge sort does not require recursion

Which search algorithm checks each element in a list one by one until it finds the target value?

• Binary search

• Linear search

• Merge sort

• Bubble sort

Which sorting algorithm builds the final sorted array one item at a time by inserting each new element into its correct position?

• Bubble sort

• Insertion sort

• Merge sort

• Linear search

Which of the following algorithms requires the list to be sorted before it can be used?

• Linear search

• Binary search

• Bubble sort

• Insertion sort

If you have a list of 10,000 numbers, which sorting algorithm is likely to be the slowest?

• Merge sort

• Bubble sort

• Insertion sort

• Binary search

Which algorithm divides the list into halves, sorts each half, and then merges them together?

• Bubble sort

• Merge sort

• Insertion sort

• Linear search

Which of the following is NOT a searching algorithm?

• Binary search

• Linear search

• Merge sort

• None of the above

In bubble sort, after the first pass through the list, which element is guaranteed to be in its correct position?

• The smallest element

• The largest element

• The middle element

• None

Which algorithm is most suitable for searching a value in a small, unsorted list?

• Binary search

• Linear search

• Merge sort

• Bubble sort