title: Recursive nCr Combinations in Java
body: <p>I have an assignment to create two recursive methods (in Java) which calculate nCr. The first method I wrote was one using Pascal's triangle. It works, Pascal triangle's is fabulous.</p>
  <p>But now I'm in a problem as I can't think/find any other recursive solutions two write my second method which calculates nCr. I have tried using/writing a method based on finding out the factorial but that one cracks when I use big numbers.</p>
  <p>Can someone, please, give me some tips, suggestions, advises regarding other recursive ways of calculating nCr?</p>
  <p>Many thanks!</p>