3 ms·
There is no point to compare it with something from 15 years ago, but in that case, the natural competing data structure would have been a Trie, which would hav
by nudpiedo 7y ago
There is no point to compare it with something from 15 years ago, but in that case, the natural competing data structure would have been a Trie, which would have made searches at logarithmic speed (based on path) and saved as much memory as it is possible.