Answered my own question:
void ReverseDigits(int number)
{
int temp;
if(number > 1)
{
temp = number % 10;
cout << temp;
Type: Posts; User: Shikimo
Answered my own question:
void ReverseDigits(int number)
{
int temp;
if(number > 1)
{
temp = number % 10;
cout << temp;
Reversing a set of numbers using recursion
I have an algorithm here that'll let me compute the reverse of a given set of integers without using strings or arrays (which is the goal). However, I've no idea how to work recursion into this...