Benchmark: Duplicate to unique array time complexity measure w/ different approaches.

Script Preparation code:

function initArr(size) {
    const array = [];
    for (let i = 0; i < size; i++) {
        array.push(Math.floor(Math.random() * size));
    }
    return array;
}

Tests:

Solution w/ Array methods
const arr = initArr(10000); const uniqueArray = []; arr.forEach(item => { if (!uniqueArray.includes(item)) { uniqueArray.push(item); } });
Solution w/ Map
const arr = initArr(10000); const map = new Map(); const uniqueArray = arr.map(item => { if (!map.has(item)) { map.set(item, true); return item } });
Solution w/ Set
const arr = initArr(10000); const uniqueArray = Array.from(new Set(arr));

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Solution w/ Array methods
Solution w/ Map
Solution w/ Set

Fastest: N/A

Slowest: N/A

ⓘ Get performance results from real users on your website with Request Metrics.

Website Performance Monitoring by Request Metrics

Latest run results:

Run details: (Test run date: 22 days ago)

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/605.1.15 (KHTML, like Gecko) Version/15.6.1 Safari/605.1.15

Browser/OS: Safari 15 on Mac OS X 10.15.7

View result in a separate tab

Test name	Executions per second
Solution w/ Array methods	18.5 Ops/sec
Solution w/ Map	220.2 Ops/sec
Solution w/ Set	239.7 Ops/sec

Duplicate to unique array time complexity measure w/ different approaches. (version: 0)

Comparing performance of: Solution w/ Array methods vs Solution w/ Map vs Solution w/ Set

Created: 22 days ago by: Registered User

Jump to the latest result

Solution w/ Array methods

Solution w/ Map

Solution w/ Set

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A