k combinations from n

Question

Possible Duplicate:
Algorithm to return all combinations of k elements from n

The combination can be formed with 3 digits from 1,2,3,4 such a way that d1 < d2 < d3 and so on.

Eg: 123,124,234 ...

n = 4 and k = 3

How do we do this ? Any clues as to how do we do this n choose k in java ?

Original poster, you're only cheating yourself if you don't show at least a first attempt. This way we can best see where your misconceptions lie and better be able to help you. — Hovercraft Full Of Eels, Sep 06 '11 at 01:22
Nah, it is not a home work. I just got a puzzles book and I am just brushing thru it. — abracabra, Sep 06 '11 at 01:39
@abracabra: my comment had nothing to do with this being homework or not. — Hovercraft Full Of Eels, Sep 06 '11 at 01:44

Jonathan Henson · Answer 1 · 2011-09-06T03:44:56.077

2

Ok, this must be homework so only hints.

There has to be a lib somewhere in JAVA modeling combinatorics algorithms.
If there isn't, you can always write one and use that. It's easy to do, get out Pascal's Triangle and get to work.

edited Sep 06 '11 at 03:44

answered Sep 06 '11 at 01:21

Jonathan Henson

1 Answers1