Question

Find out what Binary Search is. How many tries do we need to guess a number between 1 and1000? Помогите ришить Информатика​

Answer 1

Ответ:Ислам койшише

Объяснение:

Answer 2

Binary search is an efficient search algorithm used to find a specific value within a sorted collection of elements. It works by repeatedly dividing the search space in half until the desired value is found or determined to be absent.

To guess a number between 1 and 1000 using binary search, you would start by guessing the number in the middle of the range, which is 500. If the number you guessed is higher than the target number, you would then guess the middle number between 1 and 499 (the lower half of the range). If the number is lower than the target number, you would guess the middle number between 501 and 1000 (the upper half of the range). This process is repeated, dividing the remaining search space in half with each guess until the target number is found.

Since the range is between 1 and 1000, the maximum number of tries needed to guess the correct number using binary search would be log2(1000) ≈ 9.966. This means that in the worst-case scenario, it would take approximately 10 tries to guess the number correctly.