Skip to content

feat/finished lesson_07 homework #314

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion lesson_07/conditionals/.env.test
Original file line number Diff line number Diff line change
@@ -1 +1 @@
HW_VERSION=your homework version here
HW_VERSION=B
28 changes: 26 additions & 2 deletions lesson_07/conditionals/src/lesson7.ts
Original file line number Diff line number Diff line change
Expand Up @@ -11,6 +11,13 @@ 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);
{
if (distance < 0) {
return -1;
} else if (distance > 0) {
return 1;
}
}

// TODO(you): Finish this method.

Expand All @@ -24,7 +31,9 @@ export function compareStrings(a: string, b: string): number {
* @return The factorial of n.
*/
export function computeFactorial(n: number): number {
return 0;
if (n === 0) return 1;
else if (n < 0) return 0;
else return n * computeFactorial(n - 1);
}

/**
Expand All @@ -34,7 +43,15 @@ export function computeFactorial(n: number): number {
* @return An array containing the first `n` Fibonacci values.
*/
export function getFirstNFibonacciNumbers(n: number): number[] {
return [];
if (n <= 0) return [];
if (n === 1) return [1];
if (n === 2) return [1, 1];

const FibonacciNumbers = [1, 1];
for (let i = 2; i < n; i++) {
FibonacciNumbers.push(FibonacciNumbers[i - 1] + FibonacciNumbers[i - 2]);
}
return FibonacciNumbers;
}

/**
Expand All @@ -60,6 +77,13 @@ export function binarySearch(
const pivotIndex = Math.floor((start + end) / 2); // The index in the middle of the array.

// TODO(you): Finish implementing this algorithm
if (values[pivotIndex] === value) {
return pivotIndex;
}
if (values[pivotIndex] > value) {
return binarySearch(values, start, pivotIndex - 1, value);
}
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
Expand Down
21 changes: 19 additions & 2 deletions lesson_07/conditionals/src/part_b.ts
Original file line number Diff line number Diff line change
Expand Up @@ -5,16 +5,30 @@
* @returns
*/
export function isLeapYear(year: number): boolean {
return false;
switch (true) {
case year % 400 === 0:
return true;
case year % 100 === 0:
return false;
case year % 4 === 0:
return true;
default:
return false;
}
}

/**
* Returns whether the given number is even or odd.
*
* @param num
* @returns
*/
export function isEvenOrOdd(num: number): string {
if (num % 2 === 0) {
return "even";
}
if (num % 2 !== 0) {
return "odd";
}
return "";
}

Expand All @@ -25,5 +39,8 @@ export function isEvenOrOdd(num: number): string {
* @returns
*/
export function hasVowel(word: string): boolean {
if (word.match(/[aeiou]/i)) {
return true;
}
return false;
}