Write a recursive function void mirror(void) that reads character by character (using
the function getchar()) a string terminated by ? and then displays the string in reverse order.
void main()
{
      mirror();
}

---

Difficulty level

---

This exercise is mostly suitable for LEVEL 2 students

---

void mirror()
{
	char c;
	c=getchar();
	if(c!='?')
		mirror();
	putchar(c);
}

---

Click here for more Recursive function exercises! Click here for more Recursion exercises! Back to the list of exercises

---

Looking for a more challenging exercise, try this one !!
Real and complex solutions of a second degree equation

Mistakes may occur. If, while solving, you come across any mistakes with the codes, please, don't hesitate to contact me so that we may correct it together, creating a better programming community.
All proposed suggestions are most welcomed. !!!