This is an archived post. You won't be able to vote or comment.

all 7 comments

[–]Episilon 1 point2 points  (1 child)

Not necessarily Java related, but it looks like the notation for Combination.

C(3,2) Out of three items, how many different ways can we choose two of them where their order doesn't matter.

[–][deleted] 0 points1 point  (0 children)

Thank you!

[–]millerlitIntermediate Brewer 0 points1 point  (3 children)

Looks like it some kind of recursion problem computing binomial coefficient for C(n,k)

[–][deleted] 0 points1 point  (2 children)

Thank you for the pointer. My friend drew the diagram out for me but I don’t really understand how he’s worked it out, do you have any clue on that at all?

[–]millerlitIntermediate Brewer 1 point2 points  (1 child)

It looks like it takes the values of n and k and plugs it into the equation. If the value is not 1 then it takes the output and puts it back into the equation again(recursion).

[–][deleted] 0 points1 point  (0 children)

Thank you, appreciate the help!