N
Nick Brown
Are the lookup, insertion, deletion, and sort costs of Hash objects
documented anywhere? I would be interested in average-case
and worst-case times... are they linear, logarithmic, exponential, etc.
in time?
Also, is there a way to 'tune' hashes so that they use underlying
algorithms which are faster at, say, look-ups over inserts or
vice-versa? That would be killer.
documented anywhere? I would be interested in average-case
and worst-case times... are they linear, logarithmic, exponential, etc.
in time?
Also, is there a way to 'tune' hashes so that they use underlying
algorithms which are faster at, say, look-ups over inserts or
vice-versa? That would be killer.