How do you calculate the middle index in Binary Search to avoid potential overflow?
mid = left / 2 + right / 2
mid = (left + right + 1) / 2
mid = (left + right) / 2
mid = left + (right - left) / 2
What value does binary search return if the target element is not present in the sorted array?
-1
Null
Index where the element should be inserted
It depends on the implementation
What is the key characteristic of an array that makes Binary Search applicable?
The array must be of a fixed size.
The array must contain only positive integers.
The array must be sorted.
The array must be stored in contiguous memory locations.
What happens if the target element is not present in the array during Binary Search?
It enters an infinite loop.
It returns -1.
It throws an exception.
It returns the index where the element should be inserted.
In a rotated sorted array [5, 6, 7, 1, 2, 3, 4], what is the pivot element?
4
5
1
7
What is the time complexity of Binary Search in the best-case scenario?
O(1)
O(n)
O(log n)
O(n log n)
When searching for a value in a very large sorted array, which algorithm is generally more efficient?
Linear search
Binary search
If we need to perform many searches in a sorted array, which of the following approaches will be the most efficient?
Sorting the array using Bubble Sort before each search and then performing Linear Search.
Performing Linear Search repeatedly.
Sorting the array once using an efficient sorting algorithm and then performing Binary Search repeatedly.
None of the above.
In the worst-case scenario, how many comparisons will binary search perform on a sorted array of 16 elements?
16
8
32
What is the time complexity of Binary Search in the worst-case scenario?