From 5bee55f864936884c0e58ad53c05ba42c57e3081 Mon Sep 17 00:00:00 2001
From: tuminzee <t.sheth33@gmail.com>
Date: Sat, 2 Oct 2021 11:38:33 +0530
Subject: [PATCH] Organize  Java dir

Fix Fibonacci Series Code
---
 .../Java_Programs/DP/Fibonacci.java           |  33 ++++++
 .../Java_Programs/{ => DP}/Knapsack.java      |   0
 .../Java_Programs/{ => Misc}/Anagrams.java    |   0
 .../ArrayIntersection.java}                   | 100 +++++++++---------
 .../Java_Programs/Misc/Finobbaci.java         |  28 -----
 .../Java_Programs/hello.java                  |   8 --
 6 files changed, 83 insertions(+), 86 deletions(-)
 create mode 100644 Program's_Contributed_By_Contributors/Java_Programs/DP/Fibonacci.java
 rename Program's_Contributed_By_Contributors/Java_Programs/{ => DP}/Knapsack.java (100%)
 rename Program's_Contributed_By_Contributors/Java_Programs/{ => Misc}/Anagrams.java (100%)
 rename Program's_Contributed_By_Contributors/Java_Programs/{arrayIntersection.java => Misc/ArrayIntersection.java} (92%)
 delete mode 100644 Program's_Contributed_By_Contributors/Java_Programs/Misc/Finobbaci.java
 delete mode 100644 Program's_Contributed_By_Contributors/Java_Programs/hello.java

diff --git a/Program's_Contributed_By_Contributors/Java_Programs/DP/Fibonacci.java b/Program's_Contributed_By_Contributors/Java_Programs/DP/Fibonacci.java
new file mode 100644
index 000000000..3ed23f8fd
--- /dev/null
+++ b/Program's_Contributed_By_Contributors/Java_Programs/DP/Fibonacci.java
@@ -0,0 +1,33 @@
+/**
+ * 
+ * It is a sequence such that each number is the sum of the two preceding ones; and the sequence will start from the number 0 and 1.
+ * Resources
+ * https://en.wikipedia.org/wiki/Fibonacci_number
+ * 
+ */
+
+
+
+import java.util.*;
+class Fibonacci
+{
+    public static void main(String args[])
+    {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        fibo(n);
+    }
+
+    static void fibo(int n){
+        int a = 0, b = 1, i;
+        if(n<1){ return; }
+
+        System.out.print(a + " ");
+        for(i = 1; i<n ; i++){
+            System.out.print(b + " ");
+            int c = a+b;
+            a = b;
+            b = c;
+        }
+    }
+}
\ No newline at end of file
diff --git a/Program's_Contributed_By_Contributors/Java_Programs/Knapsack.java b/Program's_Contributed_By_Contributors/Java_Programs/DP/Knapsack.java
similarity index 100%
rename from Program's_Contributed_By_Contributors/Java_Programs/Knapsack.java
rename to Program's_Contributed_By_Contributors/Java_Programs/DP/Knapsack.java
diff --git a/Program's_Contributed_By_Contributors/Java_Programs/Anagrams.java b/Program's_Contributed_By_Contributors/Java_Programs/Misc/Anagrams.java
similarity index 100%
rename from Program's_Contributed_By_Contributors/Java_Programs/Anagrams.java
rename to Program's_Contributed_By_Contributors/Java_Programs/Misc/Anagrams.java
diff --git a/Program's_Contributed_By_Contributors/Java_Programs/arrayIntersection.java b/Program's_Contributed_By_Contributors/Java_Programs/Misc/ArrayIntersection.java
similarity index 92%
rename from Program's_Contributed_By_Contributors/Java_Programs/arrayIntersection.java
rename to Program's_Contributed_By_Contributors/Java_Programs/Misc/ArrayIntersection.java
index 597bbd339..33e165eff 100644
--- a/Program's_Contributed_By_Contributors/Java_Programs/arrayIntersection.java
+++ b/Program's_Contributed_By_Contributors/Java_Programs/Misc/ArrayIntersection.java
@@ -1,51 +1,51 @@
-public class arrayIntersection{
-
-    public static void intersect(int[] a,int[] b){
-
-        int minSize = (a.length>=b.length) ? b.length:a.length;
-        int c[] = new int[minSize];
-        int z=0;
-        for(int i=0;i<a.length;i++){
-
-            for(int j=0;j<b.length;j++){
-
-                if(a[i]==b[j]){
-
-                    if(search(c, a[i])==-1){
-                        c[z]=a[i];
-                        z++;
-                    }
-                }
-            }
-        }
-
-
-    }
-
-    public static int search(int arr[],int a){
-
-        int start=0,end=arr.length-1;
-
-        while(start<=end){
-
-            int mid=(start+end)/2;
-            if(arr[mid]>a){
-                end=mid-1;
-            }else if(arr[mid]<a){
-                start = mid+1;
-            }else{
-                return mid;
-            }
-
-        }
-
-        return -1;
-    }
-
-    public static void main(String[] args) {
-        
-        int arr1[] = { 1,2,3,4,5,6,7,8,9,10};
-        int arr2[] = { 5,6,7,8,9,10,11,12,13,14,15,16};
-        intersect(arr1,arr2);
-    }
+public class ArrayIntersection{
+
+    public static void intersect(int[] a,int[] b){
+
+        int minSize = (a.length>=b.length) ? b.length:a.length;
+        int c[] = new int[minSize];
+        int z=0;
+        for(int i=0;i<a.length;i++){
+
+            for(int j=0;j<b.length;j++){
+
+                if(a[i]==b[j]){
+
+                    if(search(c, a[i])==-1){
+                        c[z]=a[i];
+                        z++;
+                    }
+                }
+            }
+        }
+
+
+    }
+
+    public static int search(int arr[],int a){
+
+        int start=0,end=arr.length-1;
+
+        while(start<=end){
+
+            int mid=(start+end)/2;
+            if(arr[mid]>a){
+                end=mid-1;
+            }else if(arr[mid]<a){
+                start = mid+1;
+            }else{
+                return mid;
+            }
+
+        }
+
+        return -1;
+    }
+
+    public static void main(String[] args) {
+        
+        int arr1[] = { 1,2,3,4,5,6,7,8,9,10};
+        int arr2[] = { 5,6,7,8,9,10,11,12,13,14,15,16};
+        intersect(arr1,arr2);
+    }
 }
\ No newline at end of file
diff --git a/Program's_Contributed_By_Contributors/Java_Programs/Misc/Finobbaci.java b/Program's_Contributed_By_Contributors/Java_Programs/Misc/Finobbaci.java
deleted file mode 100644
index 61dc56c23..000000000
--- a/Program's_Contributed_By_Contributors/Java_Programs/Misc/Finobbaci.java
+++ /dev/null
@@ -1,28 +0,0 @@
-import java.util.*;
-class fibo
-{
-    public static void main(String args[])
-    {
-        Scanner sc = new Scanner(System.in);
-        int n, sum, a = 1, b = 1, flag;
-        n = sc.nextInt();
-        System.out.print(a+" "+b);
-        for (int i = 2; i < n; i++) {
-            flag = 0;
-            sum = a+b;
-            if (sum%5==0) System.out.print("0 ");
-            else {
-                for (int j = 2; j < sum/2; j++) {
-                    if (sum % j == 0) {
-                        System.out.print(sum+" ");
-                        flag = 1;
-                        break;
-                    }
-                }
-                if (flag == 0) System.out.print("0 ");
-            }
-            a = b;
-            b = sum;
-        }
-    }
-}
diff --git a/Program's_Contributed_By_Contributors/Java_Programs/hello.java b/Program's_Contributed_By_Contributors/Java_Programs/hello.java
deleted file mode 100644
index fa09d7bd2..000000000
--- a/Program's_Contributed_By_Contributors/Java_Programs/hello.java
+++ /dev/null
@@ -1,8 +0,0 @@
-import java.util.*;
-public class first
-{
-  public static void main(String args[])
-  {
-  System.out.println("Hello World");
-  }
-}