TheAlgorithms
diff --git a/‎DIRECTORY.md‎
Lines changed: 3 additions & 0 deletions b/‎DIRECTORY.md‎
Lines changed: 3 additions & 0 deletions
diff --git a/‎src/main/java/com/thealgorithms/datastructures/bloomfilter/BloomFilter.java‎
Lines changed: 59 additions & 0 deletions b/‎src/main/java/com/thealgorithms/datastructures/bloomfilter/BloomFilter.java‎
Lines changed: 59 additions & 0 deletions
@@ -6,6 +6,8 @@
         * thealgorithms
           * audiofilters
             * [IIRFilter](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/audiofilters/IIRFilter.java)
+          * bloomfilter
+            * [BloomFilter](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/bloomfilter/BloomFilter.java) 
           * backtracking
             * [Combination](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/backtracking/Combination.java)
             * [FloodFill](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/backtracking/FloodFill.java)
@@ -84,6 +86,7 @@
               * [MaxHeap](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/heaps/MaxHeap.java)
               * [MinHeap](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/heaps/MinHeap.java)
               * [MinPriorityQueue](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/heaps/MinPriorityQueue.java)
+              * [FibonacciHeap](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/heaps/FibonacciHeap.java)
             * lists
               * [CircleLinkedList](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/CircleLinkedList.java)
               * [CountSinglyLinkedListRecursion](https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/datastructures/lists/CountSinglyLinkedListRecursion.java)
 
@@ -0,0 +1,59 @@
+package com.thealgorithms.datastructures.bloomfilter;
+
+
+public class BloomFilter<T> {
+
+    private int numberOfHashFunctions;
+    private int [] bitArray;
+    private Hash<T>[] hashFunctions;
+
+    public BloomFilter(int numberOfHashFunctions, int n) {
+        this.numberOfHashFunctions = numberOfHashFunctions;
+        hashFunctions = new Hash[numberOfHashFunctions];
+        bitArray = new int[n];
+        insertHash();
+    }
+
+    private void insertHash() {
+        for (int i = 0; i < numberOfHashFunctions; i++) {
+            hashFunctions[i] = new Hash(i);
+        }
+    }
+
+    public void insert(T key) {
+        for (Hash<T> hash : hashFunctions){
+            bitArray[hash.compute(key) % bitArray.length] = 1;
+        }
+    }
+
+    public boolean contains(T key) {
+        for (Hash<T> hash : hashFunctions){
+            if (bitArray[hash.compute(key) % bitArray.length] == 0){
+                return false;
+            }
+        }
+        return true;
+    }
+
+    private class Hash<T> {
+
+        int index;
+
+        public Hash(int index){
+            this.index = index;
+        }
+
+        public int compute(T key){
+            return index * asciiString(String.valueOf(key));
+        }
+
+        private int asciiString(String word){
+            int number = 0;
+            for (int i=0;i<word.length();i++){
+                number += word.charAt(i);
+            }
+            return number;
+        }
+    }
+
+}