Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

liquifiedkronic

  • 2 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
    • 2 years ago
    Best Response
    You've already chosen the best response.
    Medals 1

    There's a recursive version of the factorial

  2. liquifiedkronic
    • 2 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
    • 2 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\
    • 2 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

Ask a Question
Find more explanations on OpenStudy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.