Algorithm for Triangle of any size:
step 1: set i=0,j=0,row=0,osc=0,var=0
step 2: read row
step 3: if row greater than 0 then execute following codes otherwise goto
step-33
step 4: osc=row-l
step 5: set isc= 1
step 6: initialize i=osc
step 7: Repeat through step-9 while i greater than 0
step 8: Print one space
step 9: i=i-1
step 10: Print “*”
step 11: osc=osc-1
step 12: Initialize i=2
step 13: Repeat through slep-26 while i less than row
step 14: initialize k=osc
step 15: Repeat through step-17 while k greater than 0
step 16: Print one space
step 17: k=k-1
step 18: Print “*”
step 19: Initialize j=isc
step 20: Repeat through step-22 while j greater than 0
step 21: Print one space
step 22: j=j-1
step 23: Print “*”
step 24: isc=isc+ 2
step 25: osc=osc-l
step 26: i=i+1
step 27: If row not equal to one then execute following codes otherwise
goto step-33
step 28: Initialize i= 1
step 29: Repeat through step-32 while i less than or equals to row
step 30: Print “*”
step 31: Print one space
step 32: i=i+ 1
step 33: Exit
Here is the Java Example for Triangle of any size:
import java.util.*;
class RectangleofAnySize
{
public static void main(String s[])
{
int i,j,row,isc,osc,var;
i=j=row=osc=var=0;
Scanner read=new Scanner(System.in);
System.out.print("Enter Number of Rows : ");
row=read.nextInt();
System.out.println("\n");
if(row>0)
{
System.out.print("\t");
osc=row-1;
isc=1;
for(i=osc;i>0;i--)
{
System.out.print(" ");
}
System.out.println("*");
osc--;
for(i=2;i<row;i++)
{
System.out.print("\t");
for(int k=osc;k>0;k--)
{
System.out.print(" ");
}
System.out.print("*");
for(j=isc;j>0;j--)
{
System.out.print(" ");
}
System.out.println("*");
isc+=2;
osc--;
}
System.out.print("\t");
if(row!=1)
{
for(i=1;i<=row*2-1;i++)
{
System.out.print("*");
}
}
}
System.out.println("");
}
}