feat: justin lesson 07

Author: JEKLUND251

lesson_07/conditionals/.env.test

@@ -1 +1 @@
-HW_VERSION=your homework version here
+HW_VERSION=E

lesson_07/conditionals/src/lesson7.ts

@@ -10,21 +10,33 @@ import { computeLexicographicDistance } from "./util.js";
 export function compareStrings(a: string, b: string): number {
   // The distance will be a number less than 0 if string `a` is lexicographically less than `b`, 1
   // if it is greater, and 0 if the strings are equal.
-  const distance = computeLexicographicDistance(a, b);
+ const distance = computeLexicographicDistance(a, b);
 
-  // TODO(you): Finish this method.
-
-  return 0;
+ if (distance < 0) {
+   return -1;
+ } else if (distance > 0) {
+   return 1;
+ } else {
+   return 0;
+}
 }
-
 /**
  * Computes the factorial of the given value of `n`.
  *
  * @param n The value for which to compute the factorial.
  * @return The factorial of n.
  */
 export function computeFactorial(n: number): number {
-  return 0;
+    if (n === 0 ) {
+      return 1; // Base case: 0! and 1! both equal 1
+    }
+    else if (n === 1) {
+      return 1;
+    }
+    else if (n < 0) {
+      return 0;
+    }
+    return n * computeFactorial(n - 1);
 }
 
 /**
@@ -34,6 +46,22 @@ export function computeFactorial(n: number): number {
  * @return An array containing the first `n` Fibonacci values.
  */
 export function getFirstNFibonacciNumbers(n: number): number[] {
+  for (let i = 0; i < n; i++) {
+    if (n === 0) {
+      return [];
+    }
+    else if (n === 1) {
+      return [1];
+    }
+    else if (n === 2) {
+      return [1, 1];
+    }
+    else {
+      const fib = getFirstNFibonacciNumbers(n - 1);
+      fib.push(fib[fib.length - 1] + fib[fib.length - 2]);
+      return fib;
+    }
+  }
   return [];
 }
 
@@ -57,9 +85,19 @@ export function binarySearch(
     return -1;
   }
 
-  const pivotIndex = Math.floor((start + end) / 2); // The index in the middle of the array.
 
-  // TODO(you): Finish implementing this algorithm
+    const pivotIndex = Math.floor((start + end) / 2); // The index in the middle of the array.
+    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;
+    }
+  
+
+  
 
   // If values[pivotIndex] is equal to value then return `pivotIndex`.
   // Else if values[pivotIndex] is greater than the value, then

lesson_07/conditionals/src/part_e.ts

@@ -1,33 +1,84 @@
-/**
- * Write a function that takes a single character as an argument and
- * returns boolean value true if the character is an uppercase letter.
- *
- * @param char
- * @returns
- */
-export function isUppercase(char: string): boolean {
-  return false;
-}
+import { computeLexicographicDistance } from "./util.js";
 
 /**
- * Determine if a person is eligible for a driving license (age and test passed).
+ * Compares two strings lexicographically.
  *
- * @param age
- * @param passedTest
- * @returns
+ * @param a The first `string` to compare.
+ * @param b The second `string` to compare.
+ * @return -1 if a is less than b, 1 if a is greater than b, and 0 otherwise.
  */
-export function canGetDriverLicense(age: number, passedTest: boolean): boolean {
-  return false;
-}
+export function compareStrings(a: string, b: string): number {
+  // The distance will be a number less than 0 if string `a` is lexicographically less than `b`, 1
+  // if it is greater, and 0 if the strings are equal.
+  const distance = computeLexicographicDistance(a, b);
 
-/**
- * Check if a store is open based on the day and time. The store is open
- * Monday to Saturday from 9 AM to 9 PM.
- *
- * @param day
- * @param hour
- * @returns
- */
-export function isStoreOpen(day: string, hour: number): boolean {
-  return false;
+  if (distance < 0) {
+    return -1;
+  } else if (distance > 0) {
+    return 1;
+  } else {
+    return 0;
+  }
 }
+  /**
+   * Computes the factorial of the given value of `n`.
+   *
+   * @param n The value for which to compute the factorial.
+   * @return The factorial of n.
+   */
+  export function computeFactorial(n: number): number {
+    if (n === 0 || n === 1) {
+      return 1; // Base case: 0! and 1! both equal 1
+    }
+    return n * computeFactorial(n - 1);
+  }
+
+  /**
+   * Returns an array of the first `n` Fibonacci numbers starting from 1.
+   *
+   * @param n The first `n` of Fibonacci values to compute.
+   * @return An array containing the first `n` Fibonacci values.
+   */
+  export function getFirstNFibonacciNumbers(n: number): number[] {
+    if (n <= 0) {
+    return [];
+    }
+    else if (n === 1)  {
+      return [1];
+    }
+    return [];
+  } 
+  /**
+   * Finds a value in an array of values.
+   *
+   * @param values The values to search.
+   * @param start The left most index to search.
+   * @param end The right most index to search.
+   * @param value The value to look for.
+   * @return The index of the value if found in the array and -1 otherwise.
+   */
+  export function binarySearch(
+    values: number[],
+    start: number,
+    end: number,
+    value: number,
+  ): number {
+    if (end < start) {
+      // The range is not valid so just return -1.
+      return -1;
+    }
+
+    const pivotIndex = Math.floor((start + end) / 2); // The index in the middle of the array.
+    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);
+    }
+
+    // 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.
+  }