[Roko_foko]

Quote:

Originally Posted by Yashas To read a file with N keys, you will have to do (N(N+1)/2) string comparisons.Not just that, it then has to separate out the key value from the cache which is again very slow.

Are you sure about this? It's not hard to implement dictionaries that use keys that are returned by string hashing methods. And complexity you pointed (N*(N+1)/2) * M, where is M max string length will be reduced to N*M.