permute two strings using recursion? help!!!
I have figured out the "permutation" for one part and I need help with "printing" part.
Here are the conditions for my functions:
1) the stopping case of the function occurs when the length of first has zero characters
2) for void string::insert :
-The specified number of copies of c have been inserted into the string at the indicated position.
-Existing characters that used to be at or after the given position have been shifted right one spot.
3) for void string::erase :
-n characters have been removed from the string, beginning at the specified position.
--------------------------------------------------------------------------------
permute two strings using recursion? (insert & erase)
Anyone know how I can permute two strings using recursion functions: insert & erase).
Re: permute two strings using recursion? (insert & erase)
can you post all your code here