title: Biggest digit of number with recursive function
body: <p>I have a Java function I want to convert to a recursive function without using Math.max().</p>
  
  <pre><code>static int biggest (int n)
  {
    int result = 0;
    int i = n;
  
    while (i &gt; 0)
    {
      if(i % 10 &gt; result) result = i % 10;
      i = i / 10;
    }
  
    return result;
  }
  </code></pre>
  
  <p>I have tried almost every thing I had in mind but I don't get the correct method.</p>