There is a lot of value when using a Set over an Array.
I learned yesterday that Set#has(item) performs an O(log n) algorithm to determine if the value exists in it. I was able to get a small speed increase in my javascript for it.
It's entirely possible I learned wrong! I took the statement at face value, knowing I couldn't verify it myself. If that's the case, then I'm really happy I use Set all the time now.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
There is a lot of value when using a
Set
over anArray
.I learned yesterday that
Set#has(item)
performs anO(log n)
algorithm to determine if the value exists in it. I was able to get a small speed increase in my javascript for it.Good article!
AFAIK,
Set.has
implementation in V8 is really fast - it hasO(1)
time complexity.It's entirely possible I learned wrong! I took the statement at face value, knowing I couldn't verify it myself. If that's the case, then I'm really happy I use Set all the time now.