Question

this can be done in one class or two separate classes,in java thanks!

You will implement and test several short recursive methods below. With the proper use of recursion, none of these methods should require more than a dozen lines of code. Test all these in the same class. Keep adding methods and testing until all are working 5. A Fractal Pattern Examine this pattern of stars and blanks, and write a recursive method that can generate patterns such as this: With recursive thinking, the method needs only seven or eight lines of code (including two recursive calls). Your method should look like this: public static void pattern(int n, int i) // Precondition: n is a power of 2 greater than zero /Postcondition: A patten based on the above example has been //printed. The longest line of the pattern has // n stars beginning in column i of the output. For example, Il The above pattern is produced by the initially calling pattern(8, 0) Hints: 1. You only need to check that n> 0. You do not need to check that n is a power of 2 2. There is no space before the first star on the first line. There are 2 spaces before the star on the 3rd line and 4 spaces before the star on the 4h line, etc Think about how the pattern is a fractal (a never-ending pattern). Fractals are created by repeating a simple process over and over in an ongoing feedback loop See if you can find two smaller versions of the pattern within the larger pattern. Here is some code that may be useful within your recursive method 3. 4. 5. A loop to print exactly i spaces: for (k-0; k

Answer 1

public static int factorial(int n) if(n ## 1) // base case return 1; // calling recursively with 1 less and multiplying n return n factorial(n-1); public static double pow (double base, int exponent) if(exponent 1) // base case return base; // calling recursively with 1 less and multiplying base return base pow (base, exponent-1);

CODE

class Main {

public static int factorial(int n)

{

if(n == 1) // base case

return 1;

// calling recursively with 1 less and multiplying n

return n*factorial(n-1);

}

public static double pow(double base, int exponent)

{

if(exponent == 1) // base case

return base;

// calling recursively with 1 less and multiplying base

return base*pow(base, exponent-1);

}

public static void main(String[] args) {

System.out.println(factorial(5));

System.out.println(pow(3.0, 4));

}

}

OUTPUT

120
81.0

// We are allowed to answer 2 coding questions only. Please post accordingly.