2.1.3 Searching & Sorting Algorithms-cs-new

What is the prerequisite for using a binary search?

• The list must be sorted

• The list must be of even length

• No prerequisites needed

• The list must contain unique elements

Which search algorithm is known for being simple and searches each data item in sequence?

• Binary Search

• Bubble Sort

• Merge Sort

• Linear Search

Which sorting algorithm is based on the idea of 'divide and conquer'?

• Merge Sort

• Binary Search

• Bubble Sort

• Insertion Sort

What is a major disadvantage of using a bubble sort?

• It requires additional memory

• It cannot sort numeric data

• It is too complex

• It is not suitable for large data sets

How does an insertion sort process elements?

• Selects the middle element as pivot

• Inserts elements into the correct position

• Swaps adjacent elements

• Divides the list into halves

Which search method would be most efficient for a large, sorted list of data?

• Linear Search

• Binary Search

• Bubble Sort

• Insertion Sort

What is the initial step in a merge sort?

• Swapping adjacent elements

• Sorting the left part of the list

• Dividing the list into half repeatedly

• Checking each element sequentially

Which sorting algorithm sorts the list by repeatedly swapping adjacent elements that are out of order?

• Binary Search

• Insertion Sort

• Merge Sort

• Bubble Sort

What is the main advantage of using a binary search over a linear search?

• Less memory usage

• Faster search times for large, sorted lists

• Easier to implement

• No need to sort the list