Question
recursion java help
5. write a recursive program which takes a int number as a parameter and squares this int number until the result is greater
0 0
Add a comment Improve this question Transcribed image text
Answer #1
public class RecMethod {

    public static int method(int n) {
        if (n >= 18560) {
            return n;
        } else {
            return method(n*n);
        }
    }

    public static void main(String[] args) {
        System.out.println(method(10));
        System.out.println(method(200));
        System.out.println(method(20000));
    }
}
Add a comment
Know the answer?
Add Answer to:
recursion java help 5. write a recursive program which takes a int number as a parameter...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Write a java program that demonstrates recursion. This program can be in a java GUI frame...

    Write a java program that demonstrates recursion. This program can be in a java GUI frame or as a console application. On this one it is up to you. (It would probably work better as a console program for this particular program.) The input for this program is a number of boxes. Ask the user for this with a textbox or a prompt on the command line. Demonstrate recursion with a function called LoadTruck() that takes a number of boxes...

  • MUST BE IN JAVA AND USE RECURSION Write a recursive method that returns the number of...

    MUST BE IN JAVA AND USE RECURSION Write a recursive method that returns the number of all occurrences of a given word in all the files under a directory. Write a test program. Use the following header: public static long findInFile(File file, String word)

  • HELLO. I'M KINDA NEW TO JAVA AND I NEED HELP WITH A METHOD. USING RECURSION ONLY....

    HELLO. I'M KINDA NEW TO JAVA AND I NEED HELP WITH A METHOD. USING RECURSION ONLY. public static int sumaEnRango (int start,int end) -RECURSIVE METHOD THAT RETURNS THE SUM OF ALL THE CONSECUTIVE INTEGER NUMBERS BETWEEN "START" AND "END. IT ALSO RETURNS 0 IN CASE "START" IS GREATER THAN "END" THIS METHOD RETURNS AN ARITHMERIC EXCEPTION IN CASE THE PARAMETER NUMBER IS NEGATIVE I KNOW THIS IS SIMPLE METHOD BUT I'M STILL CONFUSED WHEN USING RECURSION. THANKS A LOT !!!

  • 7) Recursion Write a recursive function max_tuple(a tree which takes a tree as a parameter and...

    7) Recursion Write a recursive function max_tuple(a tree which takes a tree as a parameter and returns the max values of the right and left subtree. You can assume that the parameter is a full binary tree (in a pyramid shape like with more than 3 nodes. Your solution should not have any iteration. You can use a helper function if needed. Your code should be indented correctly. The expected return value of max_tuple(tree) for the tree below should be(...

  • 1.Write code for a Java method, printArray, that takes an int array as parameter and prints...

    1.Write code for a Java method, printArray, that takes an int array as parameter and prints it out, one element per line. public static void printArray (int[] values){ Methods that do NOT return a result have “void” as return type. Notice how an array parameter type is passed, int [] }// end printArray 2.Write code for a Java method that takes in as input parameter an integer number, say num, and returns a double array of size num with all...

  • (Java) - Write a recursive program that takes array of number and an integer, and returns...

    (Java) - Write a recursive program that takes array of number and an integer, and returns true if the integer is in the array or false if the integer is not in the array

  • X43: countEvens Write a function in Java that takes an int array as its parameter and...

    X43: countEvens Write a function in Java that takes an int array as its parameter and returns the number of even ints it contains. Note: the % "mod" operator computes the remainder, e.g. 5 % 2 is 1. Complete the code bellow. Complete the code below. Use: logic conditionals if arrays loops mod public int countEvens(int[] nums) { }

  • Using Java IDE Write a recursive method which takes an integer number and returns the sum...

    Using Java IDE Write a recursive method which takes an integer number and returns the sum of the numbers from 1 to that number. The method must solve the problem recursively.Then write an application which calls the method with a few different numbers and displays the return value of the method.

  • Using Java: 1. Recursive Multiplication Write a recursive function that accepts two arguments into the parameters...

    Using Java: 1. Recursive Multiplication Write a recursive function that accepts two arguments into the parameters x and y. The function should return the value of x times y. Remember, multiplication can be performed as repeated addition as follows: 5×6=6+6+6+6+6 2. Recursive findings Write a recursive boolean method named reFinding. The method should search an array for a specified value, and return true if the value is found in the array, or false if the value is not found in...

  • Java Program Write a recursive method that takes a string and return a string where every...

    Java Program Write a recursive method that takes a string and return a string where every character appears twice. Output must match exactly as below: only two LL's since there is already two of the character For example, if the string is “HELLO”, it will return “HHEELLOO”. Write a program to test it. must be recursive!!!

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT