Counting comparisons in binary search
Adds a counter to the binary search implementation in chapter 1 of Bhargava, A. Y., (2016), Grokking Algorithms. Shows how many comparisons are needed to find a given number in a list using binary search.
Related question on cs.stackexchange https://cs.stackexchange.com/questions/117492/worst-case-runtime-for-binary-search/117671#117671 .