veiga2

Is there any functions that can show the number of combinations of a number... for example: 1) show the number of cobinations(without repeatition) from numbers 1 to 7,

example:
(1234567)
combinations:
123456
123457
123467
123567
124567
134567
234567

or what kind of algorithm will i do to present the numbers( i think for loops will be the key in showing the solution).

Random Spirit

Am i seeing double.

Did you not post exactly the same question in the C++ forum and grumpy gave you a very good hint on how to do it? Seriously if you cant figure out your own algorithms then you will never succeed at programming.

v0id

Permutations?
You say it should show the number of combinations with the numbers 1-7, but in your example you only use a 6 ciphered number?
Shouldn't it be
or something like that?

I agree with Random Spirit, there's no reason to create two threads when you're searching an algorithm. And as Random Spririt said, grumpy came with some good hints to how you do it, then follow them!

__________________

uman

I don't know why you posted this in the Java forum. It has nothing to do with Java or any other programming language.

The number of combinations of n objects taken m at a time is n!/((n-m)!*m!).

The only algorithm I can think of at the moment is a ridiculously inefficient recursive solution. It's 2 in the morning and I've got a splitting headache. I'm sure someone in a better mental state will be able to help you.

edit: v0id, you're talking about P(7,7), he's doing C(7,6)

edit again: I'm using the P() and C() notation my math teacher used. She's a retard, so she may well have cooked that up. P(n, m) is the number of permutations of n objects taken m at a time.

__________________
Few people deserve to be compared to (Rush) Limbaugh, most of them were convicted at the Nuremburg trials.
--WilliamSChips on Slashdot

v0id

Oh, okay, my bad.

__________________

andro

I think the proper notation is nPr and nCr