Searching and sorting algorithms

What is a necessary condition for using binary search instead of linear search?

• The list must be sorted.
• The list must contain unique elements.
• The list must be small in size.
• The list must be unsorted.

If a binary search takes 3 steps to find an item in a sorted list of 8 elements, how many steps will it take for a list with 16 elements in the worst case?

• 5 steps
• 4 steps
• 3 steps
• 2 steps

In which scenario is linear search more efficient than binary search?

• When searching for multiple occurrences of an item.
• When the list is unsorted.
• When the list is very large.
• When the list is sorted.

Given the list [5, 2, 9, 3, 7], how many comparisons would linear search make to find the value 7?

• 5 comparisons
• 4 comparisons
• 2 comparisons
• 3 comparisons

What occurs during a single pass of the bubble sort algorithm?

• The largest element is moved to its correct position.
• The elements are sorted in descending order.
• The list is divided into sub-lists.
• The smallest element is moved to its correct position.

How many passes would bubble sort require in the worst case to fully sort a list of 5 elements?

• 5 passes
• 2 passes
• 4 passes
• 3 passes

In the worst case, how many total comparisons would bubble sort make for a list of 6 elements?

• 28 comparisons
• 21 comparisons
• 36 comparisons
• 15 comparisons

What is the first step in the merge sort algorithm?

• Identify the largest element.
• Merge the sub-lists into a single list.
• Divide the list into sub-lists.
• Sort the list in ascending order.

Why is merge sort generally more efficient than bubble sort for large datasets?

• It uses a divide-and-conquer approach.
• It requires fewer comparisons.
• It sorts in place.
• It is easier to implement.

Which sorting algorithm has a worst-case time complexity of O(n^2)?

• Insertion Sort
• Bubble Sort
• Quick Sort
• Merge Sort