reversing a string recursively?

[Tool]

Could anyone help me writing this function recursively?

I know how to write it without recursion.

void Reverse2(char s[])
{
     int c, i, j;
     
     for(i = 0, j = strlen(s)-1; i<j; i++, j--)
     {
         c = s[i];
         s[i] = s[j];
         s[j] = c;
     }
}

[itCbitC]

Search the cboard for plenty of similar posts.

[Tool]

void reverse(char *s, int len)
{

     if(len <= 0)
        return;
     
     int temp = s[0];
     s[0] = s[len-1];
     s[len-1] = temp;
     
     reverse(s + 1, len - 2);
     
}

I think i did it, but it uses pointers! Is there a way to do this without pointers?

[laserlight]

I think i did it, but it uses pointers! Is there a way to do this without pointers?

Not really. The problem is that since in many contexts an array is converted to a pointer to its first element, completely avoiding pointers when working with arrays is practically impossible.

Of course, you can try to avoid pointer notation further by passing an index along with a pointer to the first character of the array, but that is not so elegant.

[Tool]

What about this:

void reverse2(char s[])
{
     static int i = 0;
     static int j = strlen(s);
     
     if(j <= strlen(s) / 2)
        return;
     
     char temp = s[i];
     s[i] = s[j-1];
     s[j-1] = temp;
     
     i++, j--;
     reverse2(s);
     
}

Uses static int instead of pointers.

[laserlight]

That is just horrible. Does it even compile? If it does, how are you going to reuse the function?

[Tool]

Oh, your right. I forgot static works only for the first call.

Ill just go with the pointer version then .