minor edits

Author: 0xbrayo

other/NestedBrackets.go

@@ -19,9 +19,8 @@ import (
 )
 
 func isBalanced(input string) string {
-/*	if len(input)%2 == 0{
+	if len(input)%2 == 0{
 		return input + "is not balanced."
-	}*/
 	if len(input) > 0 {
 		var stack []byte
 		for i := 0; i < len(input); i++ {

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-lowindex)/2))
+	mid := int((lowIndex + (highIndex-lowIndex)/2))
 	if array[mid] > target {
 		return binarySearch(array, target, lowIndex, mid)
 	} else if array[mid] < target {