Search and Sort Algorithms Quiz

What is the key feature of a linear search?

• Divides the list into halves

• Checks each item one by one

• Sorts the list before searching

• Starts from the middle of the list

Which type of data structure works best with linear search?

• Only sorted arrays

• Any list (sorted or unsorted)

• Only linked lists

• Only arrays of numbers

What is the best-case scenario for linear search?

• Item is not in the list

• Item is the first element

• Item is in the middle

• List is sorted

How many comparisons does linear search make in the worst case (n items)?

• 1

• n/2

• n

• n log n

What happens if the item is not found in a linear search?

• Returns 0

• Returns -1 or "not found"

• Returns null

• Crashes

What is the time complexity of linear search?

• O(n)

• O(log n)

• O(n log n)

• O(1)

Why might you use a linear search instead of binary search?

• It’s always faster

• Binary search is illegal in Python

• The list is not sorted

• It uses less memory

Which requirement must be true to use binary search?

• All numbers must be even

• The list must be sorted

• The list must be reversed

• The list must be an array

What is the average time complexity of binary search?

• O(n)

• O(log n)

• O(n log n)

• O(1)

Where does binary search look first?

• At the start of the list

• At the end of the list

• At the middle of the list

• Randomly