Re: Help with Permutations

Thanks for your input. You are correct, I require a formula to
calculate the subset of permutations according to the rules above. I
say the subset of 'permutations' because different orderings of the
same letters are part of the output required:

e.g. "abb" will include "bb" in its output, but only once. It will also
include both "ab" and "ba" in its output.

It is just where a result that has already been outputted once before
that it will not be generated; and I need to be able to calculate the
number of results that will be outputted (as outlined above) *before* I
run the algorithm.

Could anyone help me with the formula?

.

Relevant Pages

  • Re: find words that contains some specific letters
    ... You only build the Set of permuted letters once. ... Then, following John ... One word lookup in the Set costs Obinary search and not O. ... Indeed, my approach is fine for small permutations (e.g. word puzzles, ...
    (comp.lang.java.programmer)
  • Re: Combinatorics question
    ... >> specific set of letters. ... Within a bin, a ... > Your bin is modeled by a mathematical object called a multiset. ... > If you order the objects, you can deal with permutations of the set ...
    (sci.math)
  • Re: Combinatorics
    ... combinations (with and without repetition) ... but the standard combinatorics (replacement ... (permutations with replacement) ...
    (comp.lang.python)
  • Re: Reading in a Dictionary File
    ... Not necessarily a BufferedReader. ... calculate the permutations of the letters, and then try to match them ... Creating permutations and looking them up probably isn't such a good idea ... Using a trie, it can be much easier to start with the few ...
    (comp.lang.java.help)
  • Re: Combinatorics question
    ... > specific set of letters. ... Within a bin, a ... Your bin is modeled by a mathematical object called a multiset. ... you can deal with permutations of the set ...
    (sci.math)
Quantcast