The sorted values array contains the sixteen integers 1, 2, 3, 13, 13, 20, 24, 25, 30, 32, 40, 45, 50, 52, 57, 60. How many recu
Licemer1 [7]
The number of recursive calls that have to be done using the binary search is 4.
<h3>How to do the recursive calls</h3>
binarySearch = (45, 0, 15)
start + end / 2 = value
mid = 0 + 15/2 = 7.5
The 7th element = 30
30 is less than 45
8 + 15/3
= 23/2 = 11.5
The 12th element = 52
52 is greater than 45
8 + 11/2
= 19/2 = 9.5
The value of 9 = 40 and 40 is less than 45
10+ 11/2 = 10.5
The tenth value is 45 hence the iteration to be done is 4.
Read more on binary here:
brainly.com/question/21475482
#SPJ1
Answer:
N/A
Explanation:
im sorry mate, but this sounds like its supposed to be a paper by you, i cant write a paper for you, but i can help you make one, ive got some methods and tricks i can share to make it easier
again not trying to be mean, just trying to help the best way i can :)
True, it uses two mirrors to project the image thought the viewfinder when the light passes through the lens it bounce on a mirror, then the light bounce again in a pentaprism or mirrors to project in the viewfinder