Skip to content

Create Polygon_Recursion.java #43

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Jayshah-JS1312 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create Polygon_Recursion.java #43

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
37 changes: 37 additions & 0 deletions geometry/Polygon_Recursion.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
import java.util.Scanner;
import java.io.*;
class Polygon
{
public static void main(String args[])
{
Scanner inp=new Scanner(System.in);
System.out.println("Enter number of sides");
int n=inp.nextInt();
int x[] = new int[n];
int y[] = new int[n];
for(int i=0;i<n;i++)
{
x[i] = inp.nextInt();
y[i] = inp.nextInt();
}
int m=1;
int flag1 = m+1;
int flag2 = m+2;
int sum=0;
int temp=0;
int result = Area(n,m,flag1,flag2,sum,temp);
System.out.println("Area is "+result);
}
static int Area(int n,int m,int flag1,int flag2,int sum,int temp)
{
if(flag1>n || flag2>n)
{
return sum;
}
temp = m*flag1*flag2;
flag1++;
flag2++;
sum = sum + temp;
return Area(n,m,flag1,flag2,sum,temp);
}
}