Searching and Sorting Algorithms

Which of these algorithms is used to search through an ordered list?

• Linear search

• Binary search

• Bubble sort

• Merge sort

What does a linear search do?

• Sorts data before searching

• Checks each item one by one

• Compares pairs of numbers

• Removes duplicates

What is a key requirement for binary search to work?

• The list must be sorted

• The list must be random

• The data must be numeric

• The list must be in reverse order

Which search is more efficient for large sorted lists?

• Linear search

• Binary search

• Merge search

• Bubble search

What does a binary search do after checking the middle value?

• Always starts again

• Searches both halves

• Discards half the list

• Sorts the list

What is the main idea behind a bubble sort?

• Split and merge the list

• Repeatedly swap adjacent items if they’re in the wrong order

• Randomly shuffle until sorted

• Add items to a queue

Which sorting algorithm repeatedly divides the list into halves?

• Bubble sort

• Merge sort

• Linear sort

Which sort is usually more efficient: bubble or merge?

• Bubble

• Merge

• They are the same

• Depends on the data

What is a disadvantage of bubble sort?

• It is slow for large lists

• It can’t handle numbers

• It only works on sorted data

• It changes the data type

In merge sort, what happens after the list is divided?

• A. It is deleted

• B. The smaller lists are merged back in order

• C. It is passed to bubble sort

• D. Each item is sorted manually