Which of the following is NOT a characteristic of binary search?a.It can be implemented recursively.b.It is used to sort the arrays in an ascending order.c.It requires the array to be sorted.d.It is an iterative algorithm

What is the main requirement for applying binary search?a.The array must have duplicate elements.b.The array must be sorted in ascending order.c.The array must have unique elements.d.The array must be sorted in descending order.

How does the binary search work? a. Divides an array into two smaller subarrays and applies a linear search to each of them b. None of the above c. Compares each second element with a key recursively d. Recursively goes to the left or right subarrays and compares a key with the middle e. Compares each element with a key starting from 0`s element till the last element iteratively

Which of the following scenarios would make Binary Search inefficient?Searching in a large, sorted array.Searching in a small, unsorted array.Searching in a large, unsorted array.Searching in a large, sorted linked list.

In which case does the binary search algorithm perform the worst? Question 17Select one: When the array contains duplicate elements When the element is not present in the array When the array is already sorted When the element is at the middle of the array

In which case is binary search not applicable?