Cantor Set program Program plan: Import the required packages. Create the class “CantorSet”. Define the “size” to “243” Define the “main()” method. Create an object for scanner class. Get the value from the user. Initialize drawing panel. Create an object for graphics. Call the method “drawLine()”. Define the method “drawLine()”. Check whether the “stage” is greater than “0”. Get the size. Call the method “drawBox()” recursively.

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 17E

Program Plan Intro

Cantor Set program

Program plan:

Import the required packages.

Create the class “CantorSet”.

Define the “size” to “243”

Define the “main()” method.

Create an object for scanner class.

Get the value from the user.

Initialize drawing panel.

Create an object for graphics.

Call the method “drawLine()”.

Define the method “drawLine()”.

Check whether the “stage” is greater than “0”.

Get the size.

Call the method “drawBox()” recursively.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

1. Write a recursive method expFive(n) to compute y=5^n. For instance, if n is 0, y is 1. If n is 3, then y is 125. If n is 4, then y is 625. The recursive method cannot have loops. Then write a testing program to call the recursive method. If you run your program, the results should look like this: > run RecExpTest Enter a number: 3 125 >run RecExpTest Enter a number: 3125 2. For two integers m and n, their GCD(Greatest Common Divisor) can be computed by a recursive function. Write a recursive method gcd(m,n) to find their Greatest Common Divisor. Once m is 0, the function returns n. Once n is 0, the function returns m. If neither is 0, the function can recursively calculate the Greatest Common Divisor with two smaller parameters: One is n, the second one is m mod n. Although there are other approaches to calculate Greatest Common Divisor, please follow the instructions in this question, otherwise you will not get the credit. Meaning your code needs to follow the given algorithm. Then…

Pascal's triangle is a useful recursive definition that tells us the coefficients in the expansion of the polynomial (x + a)^n. Each element in the triangle has a coordinate, given by the row it is on and its position in the row (which you could call a column). Every number in Pascals triangle is defined as the sum of the item above it and the item above it and to the left. If there is a position that does not have an entry, we treat it as if we had a 0 there. *picture of the pascals triangle* Given the following recursive function signature, write the recursive function that takes a row and a column and finds the value at that position in the triangle. Assume that the triangle starts at row 0 and column 0. Examples: pascal(2, 1) -> 2, pascal(1, 2) -> 0 public int pascal(int row, int column) { }

Please help me make any of the fractals below using recursion. Please comment each line of the code Just worry about the last image for each fractal