Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re: Extreme Example of TMTOWTDI

by sporte01 (Acolyte)
on Mar 22, 2002 at 21:55 UTC ( #153662=note: print w/replies, xml ) Need Help??

in reply to Extreme Example of TMTOWTDI

Here's a simple explination onw hat you are doing. Everytime you find a word of a specific length, you pretty much open-write-close.

It's an expensive thing to open a file, not so expensive you should never open a file, but its expensive. You don't wanna do it too often. In your first loop, you are opening/closing x times. x = lines in text file you are reading from.

In the second one, you pretty much read all the data into memory and then open/close y times. y = number of different lengths.

SO now its a matter of ~25000 file open/close vs max word length times (~20? ~50?)

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (3)
As of 2020-02-17 06:34 GMT
Find Nodes?
    Voting Booth?
    What numbers are you going to focus on primarily in 2020?

    Results (70 votes). Check out past polls.