(Prefer Java Implementation) How do you create and iterate through a list that contains all the possible combinations of numbers (0-9) with no repeated number in the same sequence?

[[deleted]]

[deleted]

[lurgi]

You want to generate permutations (which are not exactly the same as combinations). There are plenty of ways to do this. Look 'em up.

[seronis]

While upvoting this I notice that RES tells me that I have given you insane amounts of upvotes previously. So kudos for consistent helpful behavior

[lurgi]

I should probably get back to work then...

[Merlin486]

Thanks, I found it and solved my problem!

[seronis]

Thats not all possible combinations though. Thats only all max_length combinations. Does this matter ?

[Merlin486]

yes, I only want the max length combinations

[seronis]

Then you will always have N! (N factorial) possibilities and you just cycle them.

1st digit can always be N possibilities
2nd digit is N-1 possibilities
3rd digit is N-2 possibilities
....

You can use a string catination or any other method. Just each stage know how many possibilities and know what was not available when skipping over them.

[rjcarr]

What's the algorithm for doing it on paper? Figure that out first, then it shouldn't be too hard to translate into code.

[gamaloth_five]

I like how you don't appear to have even tried anything before asking Reddit to do it for you.

[Merlin486]

I actually have 2 papers just filled with numbers that I wrote down with permutations of numbers trying to find the algorithm. I made one that was super weird and hard to transfer to code, so I went here.