Merge pull request #123 from brayo-pip/patch-1

Avoids Overflow Errors common in Binary search

Author: StepfenShawn

searches/binary_search.go

@@ -7,7 +7,7 @@ func binarySearch(array []int, target int, lowIndex int, highIndex int) int {
 	if highIndex < lowIndex {
 		return -1
 	}
-	mid := int((lowIndex + highIndex) / 2)
+	mid := int(lowIndex + (highIndex-lowIndex)/2)
 	if array[mid] > target {
 		return binarySearch(array, target, lowIndex, mid)
 	} else if array[mid] < target {
@@ -22,7 +22,7 @@ func iterBinarySearch(array []int, target int, lowIndex int, highIndex int) int
 	endIndex := highIndex
 	var mid int
 	for startIndex < endIndex {
-		mid = int((startIndex + endIndex) / 2)
+		mid = int(startIndex + (endIndex-startIndex))
 		if array[mid] > target {
 			endIndex = mid
 		} else if array[mid] < target {