Mulige sammensætninger af bogstaver

Kode 

        public static List<string> FindWordPossibilities(List<char> chars)
        {
            List<string> words = new List<string>();
            if (chars.Count > 1)
            {
                for (int i = 0, n = chars.Count; i < n; i++)
                {
                    List<char> copy = new List<char>(chars);
                        //Opret en kopi så vi ikke manipulerer med den originale liste
                    copy.RemoveAt(i); //Fjern det nuværende indeks
                    List<string> results = FindWordPossibilities(copy);
                    foreach (string result in results)
                    {
                        words.Add(chars[i].ToString() + result);
                    }
                }
            } else
            {
                words.Add(chars[0].ToString());
            }
            return words;
        }

Kode 

#include <iostream>
#include <string>
#include <list>
#include <iterator>

std::list<std::string> Words;

void NextWord(const std::string& firstPart, const std::string& lastPart)
{
   if(lastPart.size() > 1)
   {
      for(std::string::size_type n = 0; n < lastPart.size(); n++)
      {
         std::string cpy = lastPart;
         cpy = cpy.erase(n, 1);
         NextWord(firstPart + lastPart[n], cpy);
      }
   }
   else
   {
      Words.push_back(firstPart + lastPart);
   }
}

int main()
{
   NextWord("", "xvfs");
   std::copy(Words.begin(), Words.end(), std::ostream_iterator<std::string>(std::cout, "\n"));
}

Kode 

bool charInWord(string aWord, char aChar)
{
    int strLen = (unsigned) strlen(aWord.c_str());
    for(int i = 0; i < strLen; i++)
    {
        if(aWord[i] == aChar)
            return true;
    }

    return false;
}

vector<string> possibleWords(vector<char> chars, vector<string> wordList)
{
    vector<string> words;
    bool charFound = true;

    for(unsigned int i = 0; i < wordList.size(); i++)
    {
        for(unsigned int x = 0; x < chars.size(); x++)
        {
            if(!charInWord(wordList[i], chars[x]))
                charFound = false;
        }

        if(charFound)
            words.push_back(wordList[i]);
        else
            charFound = true;
    }

    return words;
}

Kode 

#include <string>
#include <list>
void FindWords(std::string chars,std::list<std::string> &words,std::string word="",bool all=false){
  if(chars.size()==1){
    word.push_back(chars[0]);
    words.push_back(word);
    return;
  }
  for(unsigned int i=0;i<chars.size();i++){
    char b=chars[0];
    std::string word2=word+b;
    chars.erase(0,1);
    FindWords(chars,words,word2,all);
    chars.push_back(b);
    if(all){
      words.push_back(word2);
    }

  }
}
int main(){
    std::string chars="xvfs";
    std::list<std::string> words;
    FindWords(chars,words,"",true);
    for(std::list<std::string>::iterator b=words.begin();b!=words.end();++b){
      std::cout<<*b<<std::endl;
    }
}

har lidt svært ved at se hvordan din egen løsning løser det du bad om.

Jeg fik klaret det med følgende kode: (Det var ikke det jeg bad om, men denne algoritme var hurtigere)