alternative simple implementation of tail recursion for binary search algorithm

binary search algorithm

  define_method(:search) do |value, array, from = 0, to = (array.size - 1)|
    mid = (from + to) / 2

    return mid if value == array[mid]
    return nil if to == 0 || from == (array.size - 1)
    value < array[mid] ? to = mid - 1 : from = mid + 1
    redo
  end