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

• Insertion sort

• Binary search

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 searching algorithm checks each element in a list one by one until it finds the target value?

• Binary search

• Linear search

• Merge sort

• Insertion sort

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

• Bubble sort

• Merge sort

• Insertion 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 algorithm is likely to be the fastest for searching a number if the list is already sorted?

• Linear search

• Binary search

• Bubble sort

• Insertion sort

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

• Bubble sort

• Merge sort

• Insertion sort

• Linear search

Which algorithm is most suitable for finding an item in a small, unsorted list?

• Binary search

• Linear search

• Merge sort

• Bubble sort

In bubble sort, after the first pass through the list, what is guaranteed?

• The smallest element is at the start

• The largest element is at the end

• The list is fully sorted

• No elements have moved

Which of the following is NOT a searching algorithm?

• Binary search

• Linear search

• Merge sort

• None of the above