Searching and Sorting Algorithms

Which search algorithm requires the list to be sorted before it can be used?

• Linear search

• Binary search

• Bubble sort

• Merge sort

What is the main advantage of linear search?

• It is very fast for large lists

• It works on both sorted and unsorted lists

• It always finds the middle element first

• It requires less memory than binary search

Which sorting algorithm repeatedly swaps adjacent elements if they are in the wrong order?

• Merge sort

• Bubble sort

• Binary search

• Linear search

Which sorting algorithm divides the list into smaller sublists and then merges them in order?

• Bubble sort

• Merge sort

• Linear search

• Binary search

What is a disadvantage of bubble sort?

• It is difficult to understand

• It is slow for large lists

• It cannot sort numbers

• It requires a sorted list to start

Which search algorithm checks each element one by one until it finds the target?

• Binary search

• Linear search

• Merge sort

• Bubble sort

What is the main advantage of merge sort over bubble sort?

• Merge sort is easier to code

• Merge sort is faster for large lists

• Merge sort uses less memory

• Merge sort only works on sorted lists

Which of the following is a disadvantage of binary search?

• It is slow for large lists

• It only works on sorted lists

• It uses a lot of memory

• It cannot find numbers

Which algorithm is most suitable for searching a small, unsorted list?

• Binary search

• Linear search

• Merge sort

• Bubble sort

What is a disadvantage of merge sort?

• It is slow for large lists

• It uses more memory than bubble sort

• It cannot sort numbers

• It only works on sorted lists