3 ms·
I'm more disappointed than appalled. It's 5000 times faster than an sequential list lookup. It is a good discussion of radix trees, though.
by mcguire 8y ago
I'm more disappointed than appalled.
It's 5000 times faster than an sequential list lookup.
It is a good discussion of radix trees, though.