Problem with tricky permutation code in c# win. form

Question

0.00/5 (No votes)

See more:

I am stuck with a part in my program and need help.

The part where i am stuck is that i need to get all possible possibilities with specific characters.

Example:-

int NoOfSpaces = 3;
string[] CharForPossibilities = new string[] {'a','b'};

OUTPUT

outputStr[0] = "aaa";
outputStr[1] = "bbb";
outputStr[2] = "baa";
outputStr[3] = "aba";
outputStr[4] = "aab";
outputStr[5] = "bba";
outputStr[6] = "bab";
outputStr[7] = "abb";

i have no idea how to achieve this. Any code snippet would be appreciated.

Thanks in advance

Posted 12-Nov-14 2:51am

agent_kruger

Updated 12-Nov-14 3:12am

v3

Add a Solution

Comments

[no name] 12-Nov-14 9:00am

Check this:
http://stackoverflow.com/questions/11208446/generating-permutations-of-a-set-most-efficiently[^]

The key word is Permutation.
https://www.google.ch/#q=permutation+c%23[^]

agent_kruger 12-Nov-14 9:08am

sir, the problem here is i have 1 extra requirement that is "NoOfSpaces" which can be 3 and CharForPossibilities can still be "a" & "b" and output will be "8" possiblities

[no name] 12-Nov-14 9:14am

I don't understand it right: Does it mean if I have two chars and NoOfSpaces= 3 then an extra space Needs to be added to {'a', 'b', ' '}? And if this right, what with NoOfSpaces= 4 will happen?

After extend your example my question above is history :)

agent_kruger 12-Nov-14 9:16am

sir please see the updated example in the question.

[no name] 12-Nov-14 9:28am

If you sort it in another way:

aaa
aab
abb
aba
bbb
baa
bba
bab

it Looks like permutation of {'a','b'} repeated one time with preceeding 'a' and one time with preceeding 'b'.

But was is the General logic behind it, if NoOfSpaces = 4 or what else...

agent_kruger 12-Nov-14 9:31am

the answer you have printed is correct sir and that is the logic i need to implement

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

PIEBALDconsult · Accepted Answer · 2014-11-12T03:25:00

Solution 2

Devolves into a simplified knapsack problem. All your items are the same size/weight and you can have multiples of each to fill the sack.

http://en.wikipedia.org/wiki/Knapsack_problem#Unbounded_knapsack_problem[^]

Posted 12-Nov-14 3:25am

PIEBALDconsult

Comments

agent_kruger 12-Nov-14 9:36am

sir can you simplify the code of c to c# as i am have forgotten syntax of c and cannot find a c to c# convertor

PIEBALDconsult 12-Nov-14 9:42am

No.

agent_kruger 12-Nov-14 9:46am

please sir a little help can help me to proceed further.