Here's the question you clicked on:
liquifiedkronic
(Java) Discover a recursive version of the C(n,r)(Combinations) formula and write a recursive method that computes the value of the formula. Embed the method in a program and test it.
There's a recursive version of the factorial
Yeah I think it is pretty much asking for one
http://www.ideone.com/cvw3h although the recursive method of computing factorials is not the best way; best way is more likely the iterative version: function factorial(n) begin ans := 1 x := 2 while x <= n begin ans := ans * x x := x + 1 end; return ans end;
Heres a recursive function for factorial. i'm C++ but the loops are the same. int recur(int n) { if(n==0) return 1; return n*recur(n-1); }