Explore Westonci.ca, the top Q&A platform where your questions are answered by professionals and enthusiasts alike. Connect with a community of experts ready to help you find solutions to your questions quickly and accurately. Discover detailed answers to your questions from a wide network of experts on our comprehensive Q&A platform.
Sagot :
Answer:
B
Explanation:
Binary search will start in the middle of the list, find which side the value is at, then look at the middle of those values. This is incredibly efficient for larger values (Although it needs to be sorted) and practical in many instances. Let's say that the desired number is 1, the binary search would look at "50" first, then proceed to compare with "5" and finally on it's third iteration, pick 1.
The maximum number of iterations needed to find the item is; Option B: 3
We are given the list of numbers as;
[1, 5, 20, 50, 51, 80, 99]
- Now, when conducting binary search, it usually starts in the middle of the list of given numbers.
- Thereafter, the next step is to find the side that the value being searched for is located before looking at the middle of those values.
- Now, if the number being searched for in the given list is 1, it means that the binary search would first look at the middle number which is 50. Thereafter, it will proceed to compare it with the second number 5 and the lastly with the third iteration, will be 1.
- Thus,the number of iterations needed to find the item is 3 iterations.
Read more about binary search at; https://brainly.com/question/24786985
We hope you found what you were looking for. Feel free to revisit us for more answers and updated information. We hope this was helpful. Please come back whenever you need more information or answers to your queries. Your questions are important to us at Westonci.ca. Visit again for expert answers and reliable information.
