How many comparisons are needed to find the desired element out of eight?

To find an element in a sorted array of eight elements using binary search, a maximum of 3 comparisons is required.

Search:

1. Compare with the median (4th or 5th element). Determine which half the desired element is in.
2. Compare with the median of the chosen half (2nd or 3rd; 6th or 7th). Determine the quarter.
3. Compare with the element within the chosen quarter. Find the element.