Rewrite a simple iterative algorithm recursively

Question

It is known that in some cases an iteration can be transformed in a recursive algorithm. How can I rewrite an iteration as simple as the following one as a recursion?

for(i=0,i<500,i++) 
    row_multiply();

I realize that, as it has been pointed out, I have to try something like...

void recursiveSolution(int i)

    {
        raw_multiply();
        if (i< 499)
            recursiveSolution(i+ 1);
    }

..., but I am unsure about how to deal with the base case and how to structure coherent C code for the recursive rewrite.

Trying something related to recursion would probably be a good place to start (as would be clarifying the question). If you don't understand recursion yet, perhaps study it a bit more before tackling this. An example: see it live — WhozCraig
– WhozCraig, Commented Jan 10, 2015 at 2:07
@user Oh I see, you should have one situation where the function stops recursing, or in simple words, where it stops calling itself, in my sample function, that is when count == 500, there the recursion stops. A very illustrative recursive functions as that of the factorial calculation, google it. And if my answer was useful you can express gratitude by clicking the check mark and accepting it. After all, since the question is closed, no one else can post answers for it. Weired thing it was closed as unclear what you're asking and yet it was answered. — Iharob Al Asimi
– Iharob Al Asimi, Commented Jan 10, 2015 at 2:17

Iharob Al Asimi · Accepted Answer · 2015-01-10 01:58:46Z

1

May be this way?

void recursiveSolution(int count)
{
    raw_multiply();
    if (count < 499)
        recursiveSolution(count + 1);
}

and then to start it

recursiveSolution(0);

edited Jan 10, 2015 at 1:58

answered Jan 10, 2015 at 1:48

Iharob Al Asimi

53.1k6 gold badges66 silver badges100 bronze badges

Sign up to request clarification or add additional context in comments.

4 Comments

ryanpattison Over a year ago

Need to check count < 500 (as the for loop does), before calling raw_multiply() as this would do it 501 times.

ryanpattison Over a year ago

raw_multiply needs to be inside the if too, same problem

user Over a year ago

Could you clarify what you mean by "and then to start it recursiveSolution(0);"?

Iharob Al Asimi Over a year ago

Well, you need to do a first call to the recursiveSolution() function, after that it will call itself recurse until the condition is met.

Collectives™ on Stack Overflow

Rewrite a simple iterative algorithm recursively

1 Answer 1

4 Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

4 Comments

Your Answer

Sign up or log in

Post as a guest

Related