From edd6ebb475380a1f5b34cdaec822f76ca6992fbd Mon Sep 17 00:00:00 2001
From: Jayshah-JS1312 <55508873+Jayshah-JS1312@users.noreply.github.com>
Date: Sun, 13 Oct 2019 01:00:23 +0530
Subject: [PATCH] Create Polygon_Recursion.java

Here area of polygon is calculated as blackbox and an Recursive algorithm(i.e. Divide and Conquer approach) is implemented to calculate the area.
---
 geometry/Polygon_Recursion.java | 37 +++++++++++++++++++++++++++++++++
 1 file changed, 37 insertions(+)
 create mode 100644 geometry/Polygon_Recursion.java

diff --git a/geometry/Polygon_Recursion.java b/geometry/Polygon_Recursion.java
new file mode 100644
index 0000000..5ff0c70
--- /dev/null
+++ b/geometry/Polygon_Recursion.java
@@ -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);
+	}
+}