On Wednesday, 16 July 2014 at 19:51:39 UTC, H. S. Teoh via
Digitalmars-d wrote:
It's like saying that sorting, in
general, cannot perform better than O(n log n), but the subset
of
sorting problems where the data is already almost sorted, there
are
algorithms that will perform better than O(n log n). The only
problem
is, they will suck when given data outside of that "easy"
subset.
Nah, it's like picking keys that allows you to use a trie.
management problems. It doesn't change the fact, though, that
when there
is a mismatch, you're back in the "hard" set, and the problem
is costly
to solve no matter what algorithm you use.
GC is always easier, sure.
