So I basically want to know what will be the Best, Avg and Worst case no of comparisons taken by Binary Search on a Sorted Array of N elements.
Consider Both cases where the element is present and not present in the Array

I have went online but unable to get a reliable and satisfactory answer