Implemented a rough version of binary search a I wrote the article

Author: joncalhoun

002_binary_search/000_tutorial/main.go

@@ -0,0 +1,41 @@
+package main
+
+import "fmt"
+
+func main() {
+	var lookingFor int = 6
+	var sortedList []int = []int{1, 3, 4, 6, 7, 9, 10, 11, 13}
+	fmt.Println("Looking for", lookingFor, "in the sorted list:", sortedList)
+
+	index := binarySearch(sortedList, lookingFor)
+	if index >= 0 {
+		fmt.Println("Found the number", lookingFor, "at:", index)
+	} else {
+		fmt.Println("Didn't find the number", lookingFor, ":(")
+	}
+}
+
+func binarySearch(sortedList []int, lookingFor int) int {
+	var lo int = 0
+	var hi int = len(sortedList) - 1
+
+	for lo <= hi {
+		var mid int = lo + (hi-lo)/2
+		var midValue int = sortedList[mid]
+		fmt.Println("Middle value is:", midValue)
+
+		if midValue == lookingFor {
+			return mid
+		} else if midValue > lookingFor {
+			// We want to use the left half of our list
+			hi = mid - 1
+		} else {
+			// We want to use the right half of our list
+			lo = mid + 1
+		}
+	}
+
+	// If we get here we tried to look at an invalid sub-list
+	// which means the number isn't in our list.
+	return -1
+}

002_binary_search/README.md

@@ -0,0 +1 @@
+See <http://www.calhoun.io/lets-learn-algorithms-an-intro-to-bubble-sort/> for the tutorials that go along with the code in `000_tutorial` and talk about the practice problems in `practice_problems`