Question

Uses Java

In this lab, you will practice using a stack as a substitute for recursion. Your task is to implement a non-recursive stack-based version of the following method: public void drawGasket(int x, int y, int side) t int sub -side / 3; //Draw center square g2d.fill (new Rectangle2D. Double(x + sub, y + sub, sub - 1, sub - 1)); if (sub >= 3) { //Draw 8 surrounding squares for (int i = 0; i < 3; i++){ for (int j = 0; j < 3; j++){ if (j1-1 II i != 1){ drawGasket (x + i * sub , y + j * sub , sub);

Answer 1

public void drawGasket(int x,int y,int side)
{
//u have to import java.util.Stack
Stack x1 = new Stack();//for storing x
Stack y1 = new Stack();//for storing y
Stack z1 = new Stack();//for storing side
  
int sub = side/3;
//draw ccenter square
g2d.fill(new Rectangle2D.Double(x+sub,y+sub,sub-1,sub-1));
  
if(sub >= 3)
{//draw 8 surrrounding squares..
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
if(j!=1||i!=1)
{
// drawGasket(x+1*sub,y+j*sub,sub);//recursive funtion...
//replacing with push and pop operations...
x1.push(x);y1.push(y);z1.push(side);//pushing current function values...
x=x+i*sub;y=y+j*sub;side = sub;//updating new values,,,
sub = side/3;
g2d.fill(new Rectangle2D.Double(x+sub,y+sub,sub-1,sub-1));//drawing a rectangle//with new values..
//poping parameters...
x=(int) x1.pop();
y = (int) y1.pop();
side = (int) z1.pop();
}
  
}
  
}
  
  
  
  
}
  
  
}