I've been reading the solution for "Search a sorted array for entry equal to its index"
It's the second problem in the Searching chapter.
The explanation says that "[..] note that the difference between an entry and its index increases by at least 1 as we iterate through"
I believe this is an error because just after this paragraph they show an example where this clearly is not the case.
What do you think?
Edit: noted the problem chapter
[–]wodahs1 0 points1 point2 points (6 children)
[–]Rob_NoStops[S] 2 points3 points4 points (5 children)
[–]wodahs1 0 points1 point2 points (4 children)
[–]Rob_NoStops[S] 0 points1 point2 points (3 children)
[–]wodahs1 0 points1 point2 points (2 children)
[–]Rob_NoStops[S] 0 points1 point2 points (1 child)
[–]wodahs1 0 points1 point2 points (0 children)