Question

binary search operation in descending order array
​

Answer 1

Answer:

BINARY SEARCH ON REVERSE SORTED ARRAY: Let's suppose that we have an array sorted in descending order and we want to find index of an element e within this array. Binary search in every step picks the middle element (m) of the array and compares it to e. If these elements are equal, than it returns the index of m.

Explanation:

HOPE IT HELPS....