x
Solved

# recursive function Simple and URGENT !!

Posted on 2006-10-22
Medium Priority
209 Views
im trying to print all possible sequences of any given 2 strings RECURSIVELY. For example, if i=2 and j=3, i want
the strings

aabbb
ababb
abbab
abbba
baabb
babab
babba
bbaab
bbaba
bbbaa

Can someone help with idea or code ?

0
Question by:beginer92
• 3
• 2

Author Comment

ID: 17786258
look, It's a part of the homework and not the complete hw.
I really need help. Pls
0

Author Comment

ID: 17786305
can I get a hint of how to think of it recursively. U said an idea is okay
0

Author Comment

ID: 17786355
damnn!

i think writting a one line hint should have been a better option than that unfriendly "sorry!"
0

LVL 45

Expert Comment

ID: 17786783
Write 'aabbb'
Find first instance of not 'a' - this is starting point.
Now swap the character at that position with the position before until that not 'a' reaches the start of the string.
Increment initial start point and repeat until start point is at end of string.
0

LVL 45

Accepted Solution

AndyAinscow earned 1500 total points
ID: 17786858
For an absolutely clear recursive function it might be better to start with 'aabbb' for example and pass that to a function which moves the first non 'a' with an 'a' to the left of it one position left then calls the function again.  It will stop when it can't swap any more characters

eg.

aabbb
ababb
baabb
....
bbbaa
and now it leaves the recursive function

(What I wrote at first can use recursion but it is really more like a loop)
0

## Featured Post

Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.