fix: lesson7.ts because 1 test was failing

Author: Ananatawa

lesson_07/conditionals/src/lesson7.ts

@@ -85,31 +85,24 @@ export function binarySearch(
   end: number,
   value: number,
 ): number {
-  while (start <= end) {
-    const mid = Math.floor((start + end) / 2);
-    if (values[mid] === value) {
-      return mid;
-    } else if (values[mid] < value) {
-      start = mid + 1;
-    } else {
-      end = mid - 1;
-    }
+  if (start > end) {
+    return -1; // base case: not found
   }
-  
-  const pivotIndex = Math.floor((start + end) / 2); // The index in the middle of the array.
+
+  const pivotIndex = Math.floor((start + end) / 2);
+
   if (values[pivotIndex] === value) {
     return pivotIndex;
   } else if (values[pivotIndex] > value) {
     return binarySearch(values, start, pivotIndex - 1, value);
   } else {
     return binarySearch(values, pivotIndex + 1, end, value);
-    return -1;
   }
+}
 
   // TODO(you): Finish implementing this algorithm
 
   // If values[pivotIndex] is equal to value then return `pivotIndex`.
   // Else if values[pivotIndex] is greater than the value, then
   // call `binarySearch(values, start, pivotIndex - 1, value)` and return its value;
-  // Else call `binarySearch(values, pivotIndex + 1, end, value)` and return its value.
-}
+  // Else call `binarySearch(values, pivotIndex + 1, end, value)` and return its value.