From e7f534b2a191f7e1783cb7eb992cc5b2c462e8c4 Mon Sep 17 00:00:00 2001
From: Abhishek Kapratwar <abhiapratwar@gmail.com>
Date: Fri, 18 Oct 2019 20:41:26 +0530
Subject: [PATCH 1/5] Added recursive fibonacci series using Java

---
 Recursion/FibonacciRecursion.java | 22 ++++++++++++++++++++++
 1 file changed, 22 insertions(+)
 create mode 100644 Recursion/FibonacciRecursion.java

diff --git a/Recursion/FibonacciRecursion.java b/Recursion/FibonacciRecursion.java
new file mode 100644
index 00000000..ae8629c7
--- /dev/null
+++ b/Recursion/FibonacciRecursion.java
@@ -0,0 +1,22 @@
+import java.util.*;
+public class FibonacciRecursion {  
+    static int n1=0,n2=1,n3=0;      
+     static void fibonacciSeries(int count){      
+        if(count>0){      
+             n3 = n1 + n2;      
+             n1 = n2;      
+             n2 = n3;      
+             System.out.print(" "+n3);     
+             fibonacciSeries(count-1);      
+         }      
+     }        
+  
+public static void main(String[] args) {  
+    Scanner scanner = new Scanner(System.in);
+    int count=0;
+    System.out.print("Enter number: ");
+    count = scanner.nextInt();
+    System.out.print(n1+" "+n2);     
+    fibonacciSeries(count-2);     
+}  
+}  
\ No newline at end of file

From f8dba09b778d2c13fb3b908403c89a375daa7ae9 Mon Sep 17 00:00:00 2001
From: Abhishek Kapratwar <abhiapratwar@gmail.com>
Date: Fri, 18 Oct 2019 20:57:16 +0530
Subject: [PATCH 2/5] Added searching for missing number in sorted array using
 java

---
 Divide_and_Conquer/SearchMissingNumber.java | 20 ++++++++++++++++++++
 1 file changed, 20 insertions(+)
 create mode 100644 Divide_and_Conquer/SearchMissingNumber.java

diff --git a/Divide_and_Conquer/SearchMissingNumber.java b/Divide_and_Conquer/SearchMissingNumber.java
new file mode 100644
index 00000000..43d4f55b
--- /dev/null
+++ b/Divide_and_Conquer/SearchMissingNumber.java
@@ -0,0 +1,20 @@
+class SearchMissingNumber{ 
+    static int missingNumber(int ar[],int size) { 
+        int a = 0, b = size - 1; 
+        int mid = 0; 
+        while ((b - a) > 1) { 
+            mid = (a + b) / 2; 
+            if ((ar[a] - a) != (ar[mid] - mid)) 
+                b = mid; 
+            else if ((ar[b] - b) != (ar[mid] - mid)) 
+                a = mid; 
+        } 
+        return (ar[mid] + 1); 
+    } 
+    public static void main (String[] args) { 
+    int ar[] = { 10,11,12,13,15,16,17,18,19 }; 
+    int size = ar.length; 
+    System.out.println("Missing number: " +missingNumber(ar, size)); 
+    } 
+} 
+  
\ No newline at end of file

From 124e83115d7fd7a64d4cbf8de65643bd80816487 Mon Sep 17 00:00:00 2001
From: Abhishek Kapratwar <abhiapratwar@gmail.com>
Date: Fri, 18 Oct 2019 21:04:10 +0530
Subject: [PATCH 3/5] Added recursive fibonacci series using Java

---
 Divide_and_Conquer/SearchMissingNumber.java | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/Divide_and_Conquer/SearchMissingNumber.java b/Divide_and_Conquer/SearchMissingNumber.java
index 43d4f55b..68e27a64 100644
--- a/Divide_and_Conquer/SearchMissingNumber.java
+++ b/Divide_and_Conquer/SearchMissingNumber.java
@@ -16,5 +16,4 @@ public static void main (String[] args) {
     int size = ar.length; 
     System.out.println("Missing number: " +missingNumber(ar, size)); 
     } 
-} 
-  
\ No newline at end of file
+}
\ No newline at end of file

From ad25995b8b8392c7ea74fae66c2a4f837ea59f0d Mon Sep 17 00:00:00 2001
From: Abhishek Kapratwar <abhiapratwar@gmail.com>
Date: Fri, 18 Oct 2019 21:06:45 +0530
Subject: [PATCH 4/5] Added searching for missing number in sorted array using
 java

---
 Divide_and_Conquer/SearchMissingNumber.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Divide_and_Conquer/SearchMissingNumber.java b/Divide_and_Conquer/SearchMissingNumber.java
index 68e27a64..6e450da9 100644
--- a/Divide_and_Conquer/SearchMissingNumber.java
+++ b/Divide_and_Conquer/SearchMissingNumber.java
@@ -16,4 +16,4 @@ public static void main (String[] args) {
     int size = ar.length; 
     System.out.println("Missing number: " +missingNumber(ar, size)); 
     } 
-}
\ No newline at end of file
+} 
\ No newline at end of file

From 90565afeb80ac7c1ea33edbe50ab1b8ffce1df1a Mon Sep 17 00:00:00 2001
From: Abhishek Kapratwar <abhiapratwar@gmail.com>
Date: Fri, 18 Oct 2019 21:10:26 +0530
Subject: [PATCH 5/5] Added searching for missing number in sorted array using
 java

---
 .../{SearchMissingNumber.java => SearchMissingNumber1.java}     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
 rename Divide_and_Conquer/{SearchMissingNumber.java => SearchMissingNumber1.java} (91%)

diff --git a/Divide_and_Conquer/SearchMissingNumber.java b/Divide_and_Conquer/SearchMissingNumber1.java
similarity index 91%
rename from Divide_and_Conquer/SearchMissingNumber.java
rename to Divide_and_Conquer/SearchMissingNumber1.java
index 6e450da9..789450d7 100644
--- a/Divide_and_Conquer/SearchMissingNumber.java
+++ b/Divide_and_Conquer/SearchMissingNumber1.java
@@ -1,5 +1,5 @@
 class SearchMissingNumber{ 
-    static int missingNumber(int ar[],int size) { 
+    static int missingNumber1(int ar[],int size) { 
         int a = 0, b = size - 1; 
         int mid = 0; 
         while ((b - a) > 1) {