Answer:
c) it will always return with an answer of 7 or fewer comparisons of data.
Explanation:
As maximum number of comparison in worst case for sorted binary search is log₂n, here n = 100, so maximum search is at least 6.6 which is approximately 7.
Dear ,you should ask it on stackoverflow and geekforgeelks , not here
You are required by law to stop twenty feet away from a school bus when driving.
You have an upcoming exam and you are confident that you have read all your books and believe you know your stuff down cold. Somehow, after sitting for your exam, you fail. To avoid this from happening again, you can use methods like SQRW or KWL to make sure that you get a better grade. Each of these techniques are initials that stand for “Survey”, “Question”, “Read”, and “Write” (SQRW) and “Know,” “Want to Know,” and “Learned” (KWL) respectively. People who make the most out of these two strategies will understand what they read and prepare notes of what they learned. These notes will come in handy when sitting for an exam. KWL, specifically, help student become better versions of themselves and improve in reading expository text.
