Sort and Searching Algorithm Assessment

What is the main characteristic of the bubble sort algorithm?

• It requires additional memory for sorting.
• It uses a divide-and-conquer strategy to sort the elements.
• It divides the list into two halves and sorts them individually.
• It compares adjacent elements and swaps them if they are in the wrong order.

Which algorithm is more efficient for large datasets, merge sort or bubble sort?

• Merge sort is more efficient than bubble sort for large datasets.
• Bubble sort is more efficient than merge sort for large datasets.
• Both algorithms are equally efficient for large datasets.
• Neither algorithm is suitable for large datasets.

In which scenario would you prefer using a linear search over a binary search?

• When the dataset is unsorted.
• When the dataset is sorted.
• When you need the fastest search time.
• When the dataset is very large.

What is a key characteristic of binary search?

• It compares every element in the dataset.
• It always finds the target value in one comparison.
• It can be used on unsorted datasets.
• It requires the dataset to be sorted before it can be used.

Which algorithm would you use for a quick search in a sorted array?

• Binary search
• Linear search
• Bubble sort
• Merge sort

Which sorting algorithm is known for its divide-and-conquer approach?

• Insertion sort

• Selection sort

• Bubble sort

• Merge sort

Why is binary search not suitable for unsorted datasets?

• It only works with datasets that are sorted.

• It requires additional memory.

• It cannot handle large datasets.

• It has a higher time complexity than linear search.

In which case is bubble sort most efficient?

• When the list is already sorted

• When the list is in reverse order

• When the list has all identical elements

• When the list is randomly ordered

Why is linear search preferred over binary search for small datasets?

• It requires the dataset to be sorted.

• It is faster for small datasets.

Which type of sort algorithm is this?

• Bubble
• Merge
• Insertion