title: Implementing recursion in Java
body: <p>Just to be clear, this is <strong>not a homework assignment</strong>, I study CS in my own time!</p>
  <p>I recently purchased a book entitled '50 puzzles for logical thinking' by Charles Phillips. I started one of them and it occurred to me that I could solve the problem using recursion. Here's the (paraphrased) question:</p>
  <blockquote>
  <p>Insert a mathematical operator (+, -, ÷, x) in each of the spaces to solve the equation:</p>
  <p>6 _ 3 _ 5 _ 7 _ 4 _ 8 = 13</p>
  </blockquote>
  <p>It is my understanding, that in order to solve this problem using recursion, I first need to identify a base case. However, I'm having trouble doing this.</p>
  <p><strong>So my question is, what is a possible base case and how should I begin to implement it? What could the recursive function look like (arguments, return type etc)?</strong> (code is helpful please)!</p>
  <p><strike>This is what I have so far: <strong>Nearly working I think</strong></strike></p>
  <p><strong>See my answer for an implementation</strong></p>
  <p>N.b. I'm using <em>Java</em></p>