Update MP2 (idk anymore)

Assignments/MP2_CalebFontenot_clion/binarySearch.cpp

@@ -2,6 +2,7 @@
 #include <vector>
 #include <climits>
 #include <algorithm>
+#include <tuple>
 
 using namespace std;
 
@@ -9,15 +10,13 @@ int binarySearch(std::vector<int> arr, int numToSearchFor) {
     std::sort(arr.begin(), arr.end());
     int first = 0;
     int last = arr.size() - 1;
-    int position = INT_MIN;
-    int middle = INT_MIN;
-    bool found = false;
+    int position = -1;
 
-    while (!found && first <= last) {
-        middle = (first + last) / 2;
+    while (first <= last) {
+        int middle = first + (last - first) / 2;
         if (arr[middle] == numToSearchFor) {
-            found = true;
             position = middle;
+            break;
         }
         else if (arr[middle] > numToSearchFor) {
             last = middle - 1;
@@ -31,9 +30,9 @@ int binarySearch(std::vector<int> arr, int numToSearchFor) {
 std::tuple<int, int> binarySearch(std::vector<std::vector<int>> arr, int numToSearchFor) {
     for (int i = 0; i < arr.size(); ++i) {
         int columnLocation = binarySearch(arr[i], numToSearchFor);
-        if (columnLocation != INT_MIN) {
+        if (columnLocation > -1) {
             return {i, columnLocation};
         }
     }
-    return {INT_MIN, INT_MIN};
-}
+    return {-1, -1};
+}