Re^2: Efficient giant hashes

Speeding it up is only possible by using less memory at a time.

Not if what he is trying to do is has a complexity greater than O(n), i.e., if he is entering into another loop of some kind for each element (or even for just every i^th element).

Comment on Re^2: Efficient giant hashes

Replies are listed 'Best First'.
Re^3: Efficient giant hashes by Anonymous Monk on Mar 14, 2005 at 11:42 UTC
Well, yeah, he could do anything else in his program that could be made faster. But since we don't know the rest of his program, nor is his question about that, it's nothing more than pure speculation, and rather pointless. Perhaps he's recompiling perl each time he inserts a hash element.	[reply]


XP is just a number
	PerlMonks