You are viewing a single comment's thread. Return to all comments →
instead of using unordered_set, it would be quicker with set because unordered_set takes a constant O(1) while set takes O(log n)
Are you actually trying to say that O(1) is slower than O(log n)?
Wat.
Sparse Arrays
You are viewing a single comment's thread. Return to all comments →
instead of using unordered_set, it would be quicker with set because unordered_set takes a constant O(1) while set takes O(log n)
Are you actually trying to say that O(1) is slower than O(log n)?
Wat.