Data commit

Task/Binary-search/Groovy/binary-search-1.groovy

@@ -0,0 +1,13 @@
+def binSearchR
+//define binSearchR closure.
+binSearchR = { a, key, offset=0 ->
+    def m = n.intdiv(2)
+    def n = a.size()
+    a.empty \
+        ? ["The insertion point is": offset] \
+        : a[m] > key \
+            ? binSearchR(a[0..<m],key, offset) \
+            : a[m] < target \
+                ? binSearchR(a[(m + 1)..<n],key, offset + m + 1) \
+                : [index: offset + m]
+}

Task/Binary-search/Groovy/binary-search-2.groovy

@@ -0,0 +1,17 @@
+def binSearchI = { aList, target ->
+    def a = aList
+    def offset = 0
+    while (!a.empty) {
+        def n = a.size()
+        def m = n.intdiv(2)
+        if(a[m] > target) {
+            a = a[0..<m]
+        } else if (a[m] < target) {
+            a = a[(m + 1)..<n]
+            offset += m + 1
+        } else {
+            return [index: offset + m]
+        }
+    }
+    return ["insertion point": offset]
+}

Task/Binary-search/Groovy/binary-search-3.groovy

@@ -0,0 +1,17 @@
+def a = [] as Set
+def random = new Random()
+while (a.size() < 20) { a << random.nextInt(30) }
+def source = a.sort()
+source[0..-2].eachWithIndex { si, i -> assert si < source[i+1] }
+
+println "${source}"
+1.upto(5) {
+    target = random.nextInt(10) + (it - 2) * 10
+    print "Trial #${it}. Looking for: ${target}"
+    def answers = [binSearchR, binSearchI].collect { search ->
+        search(source, target)
+    }
+    assert answers[0] == answers[1]
+    println """
+    Answer: ${answers[0]}, : ${source[answers[0].values().iterator().next()]}"""
+}