Data commit

Task/Binary-search/Sidef/binary-search-1.sidef

@@ -0,0 +1,14 @@
+func binary_search(a, i) {
+
+    var l = 0
+    var h = a.end
+
+    while (l <= h) {
+        var mid = (h+l / 2 -> int)
+        a[mid] > i && (h = mid-1; next)
+        a[mid] < i && (l = mid+1; next)
+        return mid
+    }
+
+    return -1
+}

Task/Binary-search/Sidef/binary-search-2.sidef

@@ -0,0 +1,16 @@
+func binary_search(arr, value, low=0, high=arr.end) {
+    high < low && return -1
+    var middle = ((high+low) // 2)
+
+    given (arr[middle]) { |item|
+        case (value < item) {
+            binary_search(arr, value, low, middle-1)
+        }
+        case (value > item) {
+            binary_search(arr, value, middle+1, high)
+        }
+        case (value == item) {
+            middle
+        }
+    }
+}

Task/Binary-search/Sidef/binary-search-3.sidef

@@ -0,0 +1 @@
+say binary_search([34, 42, 55, 778], 55);       #=> 2