The binary search will perform the maximum number of comparisons by diving it into two halves the elements would be 10000.
A relatively space-efficient data structure that permits adding components and membership verification very quickly is the binary array set. Essentially, it functions as a set of sorted arrays of power-of-2 sizes.
The binary array is performed by dividing the elements into two halves then the binary search will perform the maximum number of comparisons by diving it into two halves the elements would be 10000.
Therefore, the maximum number of comparisons by diving it into two halves of the elements would be 10000.
To know more about binary arrays follow
https://brainly.com/question/13523626
#SPJ4
