Distinguishing Even and Odd Numbers with Recursion
<p>I have a problem that I'm having a tough time figuring out, figured I would see if someone could point me in the right direction.</p>

<p>I am writing a recursive method(s) that takes an <code>int</code> for it's parameter, then displays all squared values of the odd numbers (top down) then all squared values of the even numbers (again top down)</p>

<p>E.g 6 would output</p>

<blockquote>
  <p>25, 9, 1, 36, 16, 4</p>
</blockquote>

<p>My approach would be to have 3 methods. One <code>int recursiveOdd(int num)</code> that would calculate and output to console the squared values of odd. One <code>int recursiveEven(int num)</code> that would calculate and output to console the squared values of even. And one method <code>void passToRecursive(int num)</code> that simply takes the number and calls the other two methods.</p>

<p>My question is how do I approach the first method, finding the highest odd number then finding the highest even number without using a loop.</p>

<p>Obviously, the max number is going to be whatever <code>int</code> was passed from <code>main</code>. 
I simply can't think of how I would find the highest odd w/o a loop.</p>