Searching and Sorting Algorithms Quiz

Which of the following best describes how a linear search works?

• It checks each item in the list one by one until it finds the target or reaches the end.

• It repeatedly divides the list in half to find the target.

• It sorts the list before searching for the target.

• It compares each pair of items and swaps them if they are in the wrong order.

What is the main requirement for using a binary search algorithm?

• The list must be sorted.

• The list must be unsorted.

• The list must contain only numbers.

• The list must be very short.

Which sorting algorithm works by repeatedly stepping through the list, comparing adjacent items, and swapping them if they are in the wrong order?

• Merge Sort

• Bubble Sort

• Insertion Sort

• Linear Search

What is the main idea behind merge sort?

• Repeatedly swap adjacent items until the list is sorted.

• Divide the list into halves, sort each half, then combine them.

• Search for the smallest item and move it to the front.

• Insert each item into its correct position in a sorted part of the list.

Which of the following is true about insertion sort?

• It always divides the list in half.

• It builds the sorted list one item at a time by inserting each item into its correct position.

• It only works on lists of numbers.

• It requires the list to be sorted before starting.

If you have a sorted list of 32 names, what is the maximum number of comparisons binary search might need to find a name or determine it is not present?

• 5

• 6

• 16

• 32

Which search algorithm is generally faster for large, sorted lists?

• Linear Search

• Binary Search

• Bubble Sort

• Insertion Sort

What is the main disadvantage of bubble sort compared to merge sort?

• Bubble sort is more complicated to code.

• Bubble sort is much slower for large lists.

• Bubble sort cannot sort numbers.

• Bubble sort requires the list to be sorted first.

Which of the following best describes the first step in merge sort?

• Compare the first two items and swap if needed.

• Divide the list into two halves.

• Insert the first item into a new list.

• Search for the target value.

When using insertion sort, where is each new item placed?

• At the end of the list.

• In its correct position among the already sorted items.

• At the beginning of the list.

• In a random position.