v1
3/10/2021 by doctorderek -00
Setup JavaScript
const SIZE_OF_ARRAY = 100000; // 10, 1000, 100000, 1000000
const anArray = Array.from(Array(SIZE_OF_ARRAY + 1).keys());
anArray.shift(); // Array(10) [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ]
const SEARCH_VALUE = Math.floor(SIZE_OF_ARRAY / 2); // i.e. 5
let foundIt = false;
const callback = (x) => x === SEARCH_VALUEready
foundIt = anArray.includes(SEARCH_VALUE); // trueready
foundIt = anArray.filter(callback).length > 0; // trueready
foundIt = anArray.some(callback); // trueready
const length = anArray.length // cache the array's length to improve performance of for loop
for (let index = 0; index < length; index++) {
if (anArray[index] === SEARCH_VALUE) {
foundIt = true;
break;
}
}
// Reference on caching the array's length: https://medium.com/@tiggr/well-youve-got-quite-a-mess-there-haven-t-you-5ae385f22f67
ready
foundIt = anArray.find(callback) === SEARCH_VALUE; // trueteardown JavaScript
// console.log(foundIt) // true
// Author's note: according to a GitHub issue, checking the value of the result using console.log() could make a difference here.
// See https://github.com/dg92/Performance-Analysis-JS/issues/14
// I did not find that to be true in my testing, but it's worth mentioning here.