Run results for: includes sorted vs unsorted

Run details:

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

Browser: Chrome 79

Operating system: Windows

Device Platform: Desktop

Date tested: 5 years ago

Test name	Executions per second
unsorted array includes existing item	1408722.6 Ops/sec
sorted array includes existing item	1863231.5 Ops/sec
unsorted array includes unexisting item	1865383.5 Ops/sec
sorted array includes unexisting item	2131081.2 Ops/sec
unsorted set has existing item	2533770.0 Ops/sec
sorted set has existing item	2611687.2 Ops/sec
unsorted set has unexisting item	2607000.8 Ops/sec
sorted set has unexisting item	2667250.5 Ops/sec

Script Preparation code:

const getRandomInteger = (min, max) => {
  const internalMin = Math.ceil(min)
  const internalMax = Math.floor(max)

  return Math.floor(Math.random() * (internalMax - internalMin)) + internalMin
}

const alphabet = ['A', 'a', 'B', 'b', 'C', 'c', 'D', 'd', 'E', 'e', 'F', 'f', 'G', 'g', 'H', 'h', 'I', 'i', 'J', 'j', 'K', 'k', 'L', 'l', 'M', 'm', 'N', 'n', 'O', 'o', 'P', 'p', 'Q', 'q', 'R', 'r', 'S', 's', 'T', 't', 'U', 'u', 'V', 'v', 'W', 'w', 'X', 'x', 'Y', 'y', 'Z', 'z']

const getRandomString = (length) =>
  Array.from({
    length
  }, () =>
    alphabet[getRandomInteger(0, alphabet.length)]).join('')

window.unsortedArray = Array.from({
  length: 50
}, () => getRandomString(getRandomInteger(5, 15)))
window.sortedArray = [...unsortedArray].sort()

window.unsortedSet = new Set([...unsortedArray])
window.sortedSet = new Set([...sortedArray])

window.existingItem = unsortedArray[getRandomInteger(0, unsortedArray.length)]
window.unexistingItem = getRandomString(25)

Tests:

unsorted array includes existing item
unsortedArray.includes(existingItem)
sorted array includes existing item
sortedArray.includes(existingItem)
unsorted array includes unexisting item
unsortedArray.includes(unexistingItem)
sorted array includes unexisting item
sortedArray.includes(unexistingItem)
unsorted set has existing item
unsortedSet.has(existingItem)
sorted set has existing item
sortedSet.has(existingItem)
unsorted set has unexisting item
unsortedSet.has(unexistingItem)
sorted set has unexisting item
sortedSet.has(unexistingItem)

Run results for: includes sorted vs unsorted

unsorted array includes existing item

sorted array includes existing item

unsorted array includes unexisting item

sorted array includes unexisting item

unsorted set has existing item

sorted set has existing item

unsorted set has unexisting item

sorted set has unexisting item