private void validateInput(int divider) {
    if (divider == 0) {
      throw new IllegalArgumentException(
          "You can't divide using 0 as divider. That operation is not defined");
    }
  }
Recursive version of the previous algorithm .The complexity order in space and memory terms is
the same than the iterative version. However this algorithm is more expensive in computation
terms because recursion is going to add a new frame to the stack every time a recursive call
is performed. Review this algorithm and take into account this algorithm is not tail
recursive.
src/main/java/com/github/pedrovgs/problem5/DivideUsingSubtraction.java