A 1000 elements array is used to store integers ascending order. The array is used to search binary search algorithm for the integers 5215 and 7282. How many elements of the array would be examined by the algorithm to locate A). the integers 5215 stored in element 499 B.) the integers in 7282 stored

in element 686.

Question

Computers & Technology

Urijah Best

14 November, 05:35

A 1000 elements array is used to store integers ascending order. The array is used to search binary search algorithm for the integers 5215 and 7282. How many elements of the array would be examined by the algorithm to locate A). the integers 5215 stored in element 499 B.) the integers in 7282 stored

in element 686.

+4

Answers (1)

Know the Answer?

Kallie · Answer 1

The overview of the given scenario is described in the explanation section below.

Explanation:

BTS (Binary search tree) tends to be a tree with several nodes noting that perhaps the left sub-tree, along with its leaf, tends to have a key which is less than or equal to anything like the parental node value. The do-tree, including its leaf, seems to have a value greater than those of the key from it's own parent node. Binary search algorithm finds a general vicinity in the collection of O (log n) time complexity items whereby n represents the number of elements in the array.

So the provided has never been the binary search trees of its algorithm.

A. 249

B. 342