Run results for: array find vs new Set has inside a filter

I created two arrays: one with 100 numbers and another with 10,000 random numbers. Then, i filtered the first array to check for the presence of the number 5 in the second array using two different methods. In the first test case, i used the .find() method, which iterates through the 10,000-number array to locate the number 5 and returns the first matching value. In the second test case, i converted the 10,000-number array into a Set and used the .has() method to check for the presence of the number 5. The goal is to compare both approaches and determine which one is faster and which one use less memory.

Run details:

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/134.0.0.0 Safari/537.36

Browser: Chrome 134

Operating system: Windows

Device Platform: Desktop

Date tested: 16 days ago

Test name	Executions per second
array find	406889.0 Ops/sec
new Set has	181519.1 Ops/sec

Script Preparation code:

const arr = [];

for (let i = 0; i < 10000; i++) {
    const n = 10 * Math.random();
    arr.push(Math.floor(n));
}

const set = new Set(arr);

const arr2 = [];

for (let i = 1; i <= 100; i++) arr2.push(i);

​x
 
const arr = [];​for (let i = 0; i < 10000; i++) {    const n = 10 * Math.random();    arr.push(Math.floor(n));}​const set = new Set(arr);​const arr2 = [];​for (let i = 1; i <= 100; i++) arr2.push(i);

Tests:

array find
const testArr = arr2.filter(el => arr.find(e => e === 5));
const testArr = arr2.filter(el => arr.find(e => e === 5));
new Set has
const testSet = arr2.filter(el => set.has(5));
const testSet = arr2.filter(el => set.has(5));