The good news is that logarithmic growth is not bad at all, and people use larges hashes and sort large arrays all the time without much problem.
-Mark
In reply to Re^3: Designing a cache data structure
by kvale
in thread Designing a cache data structure
by spurperl
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |