Some mistakes in this book?
I have some questions about the content in Page 33.
In this section, the author said that the time complexity of binary search is O(N), which is in Line 4.
But I thought it should be O(logN) through another book, which makes me very confused. Can some people explain this to me? Thank you.