GCD code added

Author: gkcs

src/main/java/main/java/course/BloomFilterMain.java

@@ -0,0 +1,33 @@
+package main.java.course;
+
+public class BloomFilterMain {
+    public static void main(String[] args) {
+        BloomFilter bloomFilter = new BloomFilter(1000);
+        bloomFilter.mark(141432);
+        bloomFilter.mark(2354364);
+        System.out.println(bloomFilter.mayExist(141432));
+        System.out.println(bloomFilter.mayExist(723));
+        //This should be false, but bloom filters provide no guarantee on definite existence
+        System.out.println(bloomFilter.mayExist(1432));
+    }
+}
+
+class BloomFilter {
+    final long[] points;
+    private final int size;
+
+    BloomFilter(final int size) {
+        this.size = size;
+        points = new long[(size + 63) >> 6];
+    }
+
+    public void mark(int point) {
+        point %= size;
+        points[point >> 6] |= (1 << (point & 63));
+    }
+
+    public boolean mayExist(int point) {
+        point %= size;
+        return (points[point >> 6] & (1 << (point & 63))) != 0;
+    }
+}

src/main/java/main/java/videos/GCD.java

@@ -40,13 +40,16 @@ private static int binaryGcd(int a, int b) {
         while ((a & 1) == 0) {
             a = a >> 1;
         }
+        while ((b & 1) == 0) {
+            b = b >> 1;
+        }
         while (b != 0) {
-            while ((b & 1) == 0) {
-                b = b >> 1;
-            }
             int temp = a - b;
             a = b;
             b = temp;
+            while ((b & 1) == 0 && b > 0) {
+                b = b >> 1;
+            }
             if (a < b) {
                 int tempSwap = a;
                 a = b;