new files

Task/Binary-search/Go/binary-search-1.go

@@ -0,0 +1,12 @@
+func binarySearch(a []float64, value float64, low int, high int) int {
+    if high < low {
+        return -1
+    }
+    mid := (low + high) / 2
+    if a[mid] > value {
+        return binarySearch(a, value, low, mid-1)
+    } else if a[mid] < value {
+        return binarySearch(a, value, mid+1, high)
+    }
+    return mid
+}

Task/Binary-search/Go/binary-search-2.go

@@ -0,0 +1,15 @@
+func binarySearch(a []float64, value float64) int {
+    low := 0
+    high := len(a) - 1
+    for low <= high {
+        mid := (low + high) / 2
+        if a[mid] > value {
+            high = mid - 1
+        } else if a[mid] < value {
+            low = mid + 1
+        } else {
+            return mid
+        }
+    }
+    return -1
+}

Task/Binary-search/Go/binary-search-3.go

@@ -0,0 +1,5 @@
+import "sort"
+
+//...
+
+sort.SearchInts([]int{0,1,4,5,6,7,8,9}, 6) // evaluates to 4