Question

if an array has 32 elements and is sorted, what are the most amount of operations it takes to finish a binary search?

Answer 1

The total amount of operations it takes to finish a binary search are 5

About Binary Search:

A binary search algorithm operates by disregarding half of the list after each iteration. Until it locates the desired value in a given list, it splits the list repeatedly. A straightforward linear search method can be quickly improved using a binary search strategy.

A binary search algorithm always operates on a sorted list, which is the first thing to keep in mind. Therefore, sorting the provided list is the first logical step. Following sorting, the list's median is tested against the intended value.

• The central index is returned as a response if the intended value matches the value of the central index.
• The list's right side is ignored if the goal value is less than the list's central index value.
• If the intended value is higher than the value of the central index, the left half is eliminated.
• The procedure is then carried out repeatedly until the target value is discovered on short lists.

Running time of Binary search:

The formula is base-2 logarithm of n;  $log_{2}n$

where n is the number of elements.

So, 32 elements will give;

⇒ $log_{2}32$

⇒ 5

To know more about binary search visit:

https://brainly.com/question/12946457

#SPJ4