Search and Sorting Algorithms Quiz

What is the primary purpose of search algorithms?

• Sort a list of items

• Locate an item in a list of information

• Rearrange a list in ascending order

• Compare elements in an array

Which search algorithm examines each element of the array sequentially?

• Binary search

• Quick search

• Linear search

• Depth-first search

What is a disadvantage of the linear search algorithm?

• Requires sorted arrays

• Inefficient for large datasets

• Difficult to implement

• Uses too much memory

Binary search requires the array to be:

• Empty

• Sorted

• Large

• Randomized

What happens in binary search if the desired value is smaller than the middle element?

• Search moves to the upper half

• Search stops

• Search moves to the lower half

• Search continues in both halves

How many comparisons does binary search make for an array of size N in the worst case?

• N

• log₂N

• N/2

• N²

Which is an advantage of binary search over linear search?

• Works with unsorted data

• Requires fewer comparisons

• Easier to implement

• Does not require array indexing

Which search algorithm examines at most N elements in the worst case?

• Binary search

• Linear search

• Merge search

• Quick search

What is the primary purpose of sorting algorithms?

• Find the largest element in an array

• Arrange values into a specific order

• Count the number of elements in an array

• Divide an array into sections

What type of order is achieved by sorting?

• Random order

• Alphabetical order

• Ascending or descending order

• None of the above