Navigation Menu

Skip to content

Instantly share code, notes, and snippets.

@ecarlson1201
Created August 26, 2018 10:31
Show Gist options
  • Star 1 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save ecarlson1201/35340087e0cbdd954f8547a11c7e8201 to your computer and use it in GitHub Desktop.
Save ecarlson1201/35340087e0cbdd954f8547a11c7e8201 to your computer and use it in GitHub Desktop.
Arrays and Loops Drills
function average(numbers) {
function getSum(total, num){
return (total + num)
}
return (numbers.reduce(getSum))/numbers.length
}
/* From here down, you are not expected to
understand.... for now :)
Nothing to see here!
*/
// tests
function testFunctionWorks(fn, input, expected) {
if (fn(input) === expected) {
console.log('SUCCESS: `' + fn.name + '` works on `[' + input + ']`');
return true;
} else {
console.log(
'FAILURE: `' +
fn.name +
'([' +
input +
'])` should be ' +
expected +
' but was ' +
fn(input)
);
return false;
}
}
(function runTests() {
const numList1 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
const correctAns1 = 5.5;
const numList2 = [0, -1, 1];
const correctAns2 = 0;
const testResults = [
testFunctionWorks(average, numList1, correctAns1),
testFunctionWorks(average, numList2, correctAns2),
];
const numPassing = testResults.filter(function(result) {
return result;
}).length;
console.log(numPassing + ' out of ' + testResults.length + ' tests passing.');
})();
function fizzBuzz(countTo) {
let myArray = []
myArray.length = countTo
for (i = 0; i <= countTo - 1; i++) {
myArray[i] = i + 1
if (myArray[i] % 3 === 0 && myArray[i] % 5 === 0) {
myArray[i] = "fizzbuzz"
}
if (myArray[i] % 3 === 0) {
myArray[i] = "fizz"
}
if (myArray[i] % 5 === 0) {
myArray[i] = "buzz"
}
}
return myArray
}
/* From here down, you are not expected to
understand.... for now :)
Nothing to see here!
*/
// tests
(function testFizzBuzz() {
// we'll use the variables in our test cases
const countTo = 16;
const expected = [
1,
2,
'fizz',
4,
'buzz',
'fizz',
7,
8,
'fizz',
'buzz',
11,
'fizz',
13,
14,
'fizzbuzz',
16,
];
const actual = fizzBuzz(countTo) || [];
if (
expected.length === actual.length &&
expected.every(function(item, index) {
return actual[index] === item;
})
) {
console.log('SUCCESS: fizzBuzz is working');
} else {
console.log('FAILURE: fizzBuzz is not working');
}
})();
function max(numbers) {
let length = numbers.length
let max = -Infinity
while (length--){
if (numbers[length] > max){
max = numbers[length]
}
}
if (numbers.length === 0){
return undefined
}
return max
}
function min(numbers){
let length = numbers.length
let min = Infinity
while (length--){
if (numbers[length] < min){
min = numbers[length]
}
}
if (numbers.length === 0){
return undefined
}
return min
}
/* From here down, you are not expected to
understand.... for now :)
Nothing to see here!
*/
// tests
function testFunctionWorks(fn, input, expected) {
if (fn(input) === expected) {
console.log('SUCCESS: `' + fn.name + '` works on `[' + input + ']`');
return true;
} else {
console.log(
'FAILURE: `' +
fn.name +
'([' +
input +
'])` should be ' +
expected +
' but was ' +
fn(input)
);
return false;
}
}
function testEmpty(fn) {
if (fn([]) === null || fn([]) == undefined) {
console.log(`SUCCESS: ${fn.name} works on empty arrays`);
return true;
} else {
console.log(
`FAILURE: ${fn.name} should return undefined or null for empty arrays`
);
return false;
}
}
(function runTests() {
// we'll use the variables in our test cases
const numList1 = [-5, 28, 98, -20013, 0.7878, 22, 115];
const realMin1 = numList1[3];
const realMax1 = numList1[6];
const numList2 = [0, 1, 2, 3, 4];
const realMin2 = numList2[0];
const realMax2 = numList2[4];
const testResults = [
testFunctionWorks(max, numList1, realMax1),
testFunctionWorks(max, numList2, realMax2),
testFunctionWorks(min, numList1, realMin1),
testFunctionWorks(min, numList2, realMin2),
testEmpty(max),
testEmpty(min),
];
const numPassing = testResults.filter(function(result) {
return result;
}).length;
console.log(numPassing + ' out of ' + testResults.length + ' tests passing.');
})();
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment