Added recursive fibonacci series using Java

Divide_and_Conquer/SearchMissingNumber1.java

@@ -0,0 +1,19 @@
+class SearchMissingNumber{ 
+    static int missingNumber1(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)); 
+    } 
+} 

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);     
+}  
+}