If you have an array of 100 sorted elements, and you search for a value that does not exist in the array using a binary search, approximately how many comparisons will have to be done? a)7 b)100 c)50 - QAmmunity.org

If you have an array of 100 sorted elements, and you search for a value that does not exist in the array using a binary search, approximately how many comparisons will have to be done? a)7 b)100 c)50

asked Jun 13, 2022 44.8k views

1 Answer

Search QAmmunity.org