Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?

Re^3: Rewrite Program Using Arrays

by aaron_baugher (Curate)
on Mar 26, 2012 at 05:21 UTC ( #961586=note: print w/ replies, xml ) Need Help??

in reply to Re^2: Rewrite Program Using Arrays
in thread Rewrite Program Using Arrays

There is no use for push/pop here, though. This is a pretty straightforward problem: counting the occurrences of words in a file. That means putting the words in a hash as the keys and incrementing the value when a word is seen. That's what you've done, so you're already using the best algorithm. You can gain some speed by cutting out any unnecessary assignments, as I showed with the benchmarks in my other post; but you certainly won't gain anything by using a less straightforward algorithm or by shuffling your words around through extra arrays. There really aren't "a lot of things you can do to speed the process." Building a hash and sorting on the values is as fast as it's gonna get, unless you want to rewrite it in C.

Aaron B.
My Woefully Neglected Blog, where I occasionally mention Perl.

Comment on Re^3: Rewrite Program Using Arrays

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://961586]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (13)
As of 2015-11-25 21:17 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (691 votes), past polls