Purchase Solution

Reversing integer using recursion

Not what you're looking for?

Ask Custom Question

I need a recursive function that accepts an integer and returns its reverse.

for example

int reverse( int n );
int main()
{
int n;
n = reverse (123) ; // this returns 321

}

I can do this easily without recursion but I have to use recursion.
Thank you.

Purchase this Solution
Solution Summary

The expert examines reversing integers using recursion.

Solution Preview

#include "stdafx.h"
#include <iostream>

using namespace std;

static int reverse (int n) ;
static ...

Purchase this Solution
Free BrainMass Quizzes
Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

Javscript Basics

Quiz on basics of javascript programming language.

View More Free Quizzes
Related BrainMass Solutions

  • Java solution to convert decimal to a given base using recursion

    235463 Java solution to convert decimal to a given base using recursion Dear OTA - I need a Java solution that can read a decimal integer and convert it to binary or any other given base system using recursion.

  • Bessel functions

    Thanks for using BrainMass.com. The solution method uses a recursion relation and the Bessel functions J_{1/2} and J_{-1/2} in conjunction with a proof by induction.

  • Discrete Math:Recursion

    We reset our low point to the point to the index of element that is one higher than the midpoint so low = mid + 1 = 5 5) Now low point to index 5 and high still points to the last index of the array. 6) Recalculate the midpoint and using integer division

  • Fibonacci Number Visual C++ Recursion Iteration Runtime

    Given any non-negative integer n, a.Find the nth Fibonacci number using iteration. b.Find the nth Fibonacci number using recursion.

  • Recursion in Java

    I thought of using n + sum (n-1), but I need to use the recursive definition that the sum of 1 to n is the sum of 1 to n/2 plus the sum of (n/2+1) to n. Assume that n is a positive integer. Please see the source code.

  • Integration, proofs, spline interpolation

    relation: int_(0)^(infty) x^n e^(-x) dx = n * int_(0)^(infty) e^(-x) x^(n-1) dx When n = 1, we can calculate directly that int_(0)^(infty) x^1 e^(-x) dx = int_(0)^(infty) e^(-x) dx = 1, so using the recursion relation and mathematical induction

  • Matlab Code

    end function arr = reflect_my(arr,frst, lst) % Method using recursion %end condition if frst < lst tmp = arr(frst); arr(frst) = arr(lst); arr(lst) = tmp; arr arr = reflect_my(arr,frst+1,lst-1); end % % try the following

  • Java Recursion Problem

    218882 Java Recursion Problem Design a Java application that accepts a positive integer n > 1 as a command line parameter and outputs all strictly increasing integer sequences starting with 1 and ending with n.

  • Recursive power Method - Java

    Assume that exponent is an integer greater than or equal to 1.

View More Related Solutions