I need some help dealing with C++ and recursion

[tastybrownies]

Hey everyone, I am pretty new to writing procedures that deal with this idea of recursion. I am trying to get into that certain frame of mind but I am having a little bit of trouble at the last minute. My goal was to implement a text operation called swap substring using recursion.

This is what I have so far:

procedure_body Swap_Substring (
	alters Text& t1,
	preserves Integer pos,
	preserves Integer len,
	alters Text& t2
    )
{
    //first impelementation of recursion of swap_sub_string, beginning
    //starting at t2.
    object Character ch, ch2;
    if(t2.Length() >0)
    {

        debug("t1 = " << t1 << "t2 = " << t2 << "pos = " << pos << "len=" << len << '\n');
        if(len > 0)
        {
	    t1.Remove(pos, ch);
	    t2.Remove(0, ch2);
	    Swap_Substring(t1,pos, len-1, t2);
	}

	if(len > 0)
	{
	    t2.Add(0, ch);
	    t1.Add(pos, ch2);
	}

    }
    else if(t2.Length() == 0)
    {
	if(len > 0)
	{

	    t1.Remove(pos, ch);
	    Swap_Substring(t1, pos, len -1, t2);
	    t2.Add(0, ch);
	}
    }
}

I'm sure some have noticed this is not straight C++. This is effectively C++ with a designated framework I have to use for university work. Any correct C++ would probably compile though. The object of this program is to swap a sub string, like so:

t1 = smile
pos = 1(where to start)
len = 2(letters to take out)
t2 = hey(to be swapped in)

so it should be
t1 = sheyle
pos = 1
len = 2
t2 = mi

My code is ALMOST close to working completely, it looks like I'm just off by a letter.

SAMPLE OF MY INPUT AND OUTPUT:
t1 = runner
pos = 2
len = 2
t2 = zee

correct output:
t1 = ruzeeer
pos = 2
len = 2
t2 = nn

my output:
t1 = ruzeer
pos = 2
len = 2
t2 = nne

See what I mean. It's like it's one letter away. This is probably some silly error, but for the life of me I can't find it after searching hours. I would GREATLY appreciate it if anyone could help me.

Thank you and have a good evening.

[L0s3r]

My first qs. is what does Add and Remove function do.
2nd Qs. : Why you are using recursion specifically.

======================================================

Try for:

t1 = runner
pos = 2
len = 2
t2 = zeennaabbcc

You will get your mistake.

[tastybrownies]

My first qs. is what does Add and Remove function do.
2nd Qs. : Why you are using recursion specifically.

The add function adds characters to a word and the remove function removes characters.

For example,

t1 = runner

t1.Add(the position of where you want to add the character, this holds the character that is intended to be added). So, if we say

ch = 'h'
t1.Add(0, ch); ======== hrunner, or t1.Add(2, ch); ========ruhnner

Remove stores the character that was removed in ch. For example, where t1 is still runner.

t1.Remove(3, ch); would be removing the letter n. and the word is now runer and ch is now 'n'. It is usually desirable to use a loop.

I am using recursion because I am required to do so for this specific assignment. I know how to swap a sub string regularly, but....they want it a certain way. Thank you for putting up with this awkward framework....

[L0s3r]

I haven't given it much thought for different cases , but it should work.

if(t2.Length() > 0)
{

if(len > 0)
{
t1.Remove(pos, ch);
t2.Remove(0, ch2);
Swap_Substring(t1,pos, len-1, t2);
t2.Add(0, ch);
t1.Add(pos, ch2);
}

if(len==0)
{
t2.Remove(0,ch);
Swap_Substring(t1,pos, len, t2);
t1.Add(pos,ch);
}

}


else if(t2.Length() == 0)
{
if(len > 0)
{
t1.Remove(pos, ch);
Swap_Substring(t1, pos, len -1, t2);
t2.Add(0, ch);
}
}

[tastybrownies]

I really really appreciate you taking a look at this for me. It seemed like I just got carried away with if statements for my own good. The code DID work. I just did not know you could call the method more than once inside the procedure. So you can call it as many times as needed and still have your base case there at the bottom???And when you call it the instance where (len == 0) it just bypasses the case where len > 0 correct?

I also did your test case and I saw that things were correct on my up until the 5 character and then from there things went haywire. I see that my program was effectively executing the two if statements in such a fashion, where the len might not be 1 after the first call so things might not get added in continually. Is this somewhat close?

Thank you again for the big help.

[jmichae3]

Hey everyone, I am pretty new to writing procedures that deal with this idea of recursion. I am trying to get into that certain frame of mind but I am having a little bit of trouble at the last minute. My goal was to implement a text operation called swap substring using recursion.

This is what I have so far:

procedure_body Swap_Substring (
	alters Text& t1,
	preserves Integer pos,
	preserves Integer len,
	alters Text& t2
    )
{
//...
}

I'm sure some have noticed this is not straight C++. This is effectively C++ with a designated framework I have to use for university work. Any correct C++ would probably compile though. The object of this program is to swap a sub string, like so:

t1 = smile
pos = 1(where to start)
len = 2(letters to take out)
t2 = hey(to be swapped in)

See what I mean. It's like it's one letter away. This is probably some silly error, but for the life of me I can't find it after searching hours. I would GREATLY appreciate it if anyone could help me.

Thank you and have a good evening.

I was thinking,IF you have anything like a substring function or method available for your strings, OR you have access to #include <string> and it works well with this framework, it would be a VERY simple matter to just do this (requires no recursion!):

string left, middle, right, result;
//do the work
left=t1.substr(0, pos);
middle=t2;
right=t1.substr(pos + t2.size(), t1.size() - (pos + t2.size()));
//accumulate result
result=left;
result+=middle;
result+=right;

http://www.cplusplus.com/reference/string/string/substr/
http://www.cplusplus.com/reference/string/string/size/