Syntactic Confectionery Delight | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
You are asking the wrong questions. You already blame the hashes without really knowing what wastes all this time. Everyone above told you to do some profiling first and that is a really good idea. Often it is the algorithm used that kills the time. For example: If your program often makes a copy of your hash then that will really thrash your memory and cost time. But you won't get it faster by changing to an array then. Also you didn't show us what the code does with the hash you blame. Then how should we be able to tell you if an array ist better So either post some code here or do some profiling or both. In reply to Re^3: Optimize my code with Hashes
by jethro
|
|