Purchase Solution

recursive method

Not what you're looking for?

Ask Custom Question

Find the error(s) in the following recursive method, and explain how to correct it (them).
This method should find the sum of the values from 0 to n.

public int sum( int n )
{
if ( n == 0 )
return 0;
else
return n + sum( n );
} // end method sum

Purchase this Solution
Solution Summary

It finds and corrects the erros in the recursive method. The response was rated '5/5' by the student who originally posted the questions.

Purchase this Solution
Free BrainMass Quizzes
C++ Operators

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

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.

C# variables and classes

This quiz contains questions about C# classes and variables.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

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.

View More Free Quizzes
Related BrainMass Solutions

  • Visualizing Recursion - Java

    Modify the factorial method in Fig. 15.3 to print its local variable and recursive-call parameter. For each recursive call, display the outputs on a separate line, and add a level of indentation.

  • Static Recursive Method

    324321 Static Recursive Method Write a Java program that demonstrates a static recursive method that accepts two integer arguments into the parameters x and y. The method should return the value of x times y.

  • Recursive Binary Search Java

    128229 Recursive Binary Search Java Modify Fig. 16.4 to use recursive method recursiveBinarySearch to perform a binary search of the array (see attached file). The method should receive the search key, starting index and ending index as arguments.

  • Recursive power Method - Java

    127370 Recursive power Method - Java Write a recursive method power( base, exponent ) that, when called, returns exponent base For example, power( 3,4 ) = 3*3*3*3. Assume that exponent is an integer greater than or equal to 1.

  • Creating a Recursive Java Program That Sorts Objects

    , Comparable target) // true if target in list The signatures of the method like the ones above.

  • Palindromes - Blanks Ignored - Java

    Write a recursive method testPalindrome that returns boolean value true if the string stored in the array is a palindrome and false otherwise. The method should ignore spaces and punctuation in the string.

  • How to Convert a Recursive Procedure into Iterative

    Recursive Procedure: A recursive procedure is a method or a function that calls itself over and over again as long as it satisfies the recursive conditionm[1][2].

  • Recursion Java Programming

    java method that calculates the sum of integers between 1 and n.

  • Greatest Common Divisor (GCD) in C++ with Example

    * A recursive program to calculate the Greatest Common Divisor of two integers using the Euclidean Method.

View More Related Solutions