What is the primary difference between Binary Search and Interpolation Search?
Binary Search always divides the array in half, while Interpolation Search estimates the position of the target element.
Binary Search only works on sorted arrays, while Interpolation Search can work on unsorted arrays.
Binary Search is faster than Interpolation Search in all cases.
Binary Search requires more memory than Interpolation Search.
In Binary Search, if the target value is less than the middle element, what should be the next step?
Search the entire array again.
Search the right half of the array.
Search the left half of the array.
Conclude the target is not present.
Which of the following best describes the advantage of binary search over linear search?
Binary search can be used on unsorted data.
Binary search is easier to implement.
Binary search uses less memory.
Binary search has a faster average-case time complexity.
Which of the following is a key difference between the iterative and recursive approaches to binary search?
Recursive binary search uses a loop, while iterative binary search uses function calls.
Iterative binary search uses a loop, while recursive binary search uses function calls.
Recursive binary search can only be used on arrays, while iterative binary search can be used on any data structure.
Iterative binary search is generally more efficient.
When searching for a value in a very large sorted array, which algorithm is generally more efficient?
Binary search
Linear search
Which data structure inherently benefits from the efficiency of binary search for searching operations?
Queue
Hash Table
Binary Search Tree
Linked List
Which of the following best describes the time complexity of binary search in the average case?
O(1)
O(n log n)
O(n)
O(log n)
If you need to perform frequent insertions or deletions in the middle of a dataset, is binary search the most suitable choice?
Yes
No
What is the space complexity of Binary Search (iterative implementation)?
You have an unsorted array, and you need to find a specific value. Is it more efficient to sort the array and then use binary search, or to directly apply linear search?
Directly use linear search
Sort and then use binary search