Which of the following statements about binary search is false?
Practice Questions
1 question
Q1
Which of the following statements about binary search is false?
It can be implemented recursively
It requires a sorted array
It can be used on linked lists
It is faster than linear search
Binary search cannot be effectively used on linked lists due to their non-contiguous memory allocation, making it inefficient compared to arrays.
Questions & Step-by-step Solutions
1 item
Q
Q: Which of the following statements about binary search is false?
Solution: Binary search cannot be effectively used on linked lists due to their non-contiguous memory allocation, making it inefficient compared to arrays.
