Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

liquifiedkronic

  • 4 years ago

(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.

  • This Question is Closed
  1. agdgdgdgwngo
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    There's a recursive version of the factorial

  2. liquifiedkronic
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Yeah I think it is pretty much asking for one

  3. agdgdgdgwngo
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    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;

  4. shankvee\
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    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); }

  5. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy