update README.md + update tests + add solution for hw2:3839

java/search/BinarySearch3839.java

@@ -0,0 +1,77 @@
+package search;
+
+/**
+ * @author Nikita Doschennikov (me@fymio.us)
+ */
+public class BinarySearch3839 {
+
+    public static void main(String[] args) {
+        IntList a = new IntList();
+        int x = Integer.parseInt(args[0]);
+        int n = args.length;
+        for (int i = 1; i < n; i++) {
+            a.put(Integer.parseInt(args[i]));
+        }
+
+        int leftBound = leftBoundIterative(x, a);
+        int rightBound = rightBoundIterative(x, a);
+        int range = rightBound - leftBound;
+        System.out.println(leftBound + " " + range);
+    }
+
+    static int leftBoundIterative(int x, IntList a) {
+        int low = 0,
+                high = a.getLength() - 1;
+        while (low <= high) {
+            int mid = low + (high - low) / 2;
+            if (a.get(mid) > x) {
+                low = mid + 1;
+            } else {
+                high = mid - 1;
+            }
+        }
+        return high + 1;
+    }
+
+    static int rightBoundIterative(int x, IntList a) {
+        int low = 0,
+                high = a.getLength() - 1;
+        while (low <= high) {
+            int mid = low + (high - low) / 2;
+            if (a.get(mid) >= x) {
+                low = mid + 1;
+            } else {
+                high = mid - 1;
+            }
+        }
+        return high + 1;
+    }
+
+    static int leftBoundRecursive(int x, IntList a, int low, int high) {
+        if (low > high) {
+            return high + 1;
+        }
+
+        int mid = low + (high - low) / 2;
+
+        if (a.get(mid) > x) {
+            return leftBoundRecursive(x, a, mid + 1, high);
+        } else {
+            return leftBoundRecursive(x, a, low, mid - 1);
+        }
+    }
+
+    static int rightBoundRecursive(int x, IntList a, int low, int high) {
+        if (low > high) {
+            return high + 1;
+        }
+
+        int mid = low + (high - low) / 2;
+
+        if (a.get(mid) >= x) {
+            return rightBoundRecursive(x, a, mid + 1, high);
+        } else {
+            return rightBoundRecursive(x, a, low, mid - 1);
+        }
+    }
+}

java/search/BinarySearchTest.java

@@ -37,11 +37,21 @@ public final class BinarySearchTest {
     }
 
 
+    // === 3839
+
+    private static String span(final int c, final int x, final int[] a) {
+        final int begin = range(0, a.length).filter(i -> a[i] == x || Integer.compare(x, a[i]) == c).findFirst().orElse(a.length);
+        final long length = range(0, a.length).filter(i -> a[i] == x).count();
+        return begin + " " + length;
+    }
+
+
     // === Common code
 
     public static final Selector SELECTOR = new Selector(BinarySearchTest.class)
             .variant("Base",    Solver.variant0("", Kind.DESC, BinarySearchTest::base))
             .variant("3637",    Solver.variant0("3637", Kind.DESC,  BinarySearchTest::count))
+            .variant("3839",    Solver.variant0("3839", Kind.DESC,  BinarySearchTest::span))
             ;
 
     public static void main(final String... args) {