Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: Benchmarking with Memory Profiling

by bikeNomad (Priest)
on Jun 10, 2001 at 22:51 UTC ( [id://87336]=note: print w/replies, xml ) Need Help??


in reply to Benchmarking with Memory Profiling

As far as learning algorithms using Perl, you're more likely to learn something if you can make test programs quickly to compare algorithms. And Perl is really good for that.

Jon Bentley had a column from 1983 through 1985 in CACM called "Programming Pearls" in which he discussed algorithm design using AWK as a programming language. He was able to discuss algorithmic complexity and optimization even though AWK didn't have any built-in tools for doing this.

He collected a number of these columns in his book Programming Pearls. Sadly, he re-wrote it using C and C++. It was easier to read in AWK, I think.

Perl should have the tools you need for your exploration.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others chilling in the Monastery: (6)
As of 2024-04-23 12:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found