This kata challenges you to implement binary search in 5 different ways and to document things you had trouble with, like "off by one errors" and fencepost errors.
Here are my attempts in Ruby.
Got any other ideas on how else to solve this? Or feedback for my code? Let me know down below in the comments!