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

Re: Re: Benchmarking with Memory Profiling

by Arguile (Hermit)
on Jun 10, 2001 at 07:40 UTC ( [id://87261]=note: print w/replies, xml ) Need Help??


in reply to Re: Benchmarking with Memory Profiling
in thread Benchmarking with Memory Profiling

I agree with the pseudo coding, often I can just pull the logic example right out of the book and have a working version to play with. I also find it's allowing me to more easily grasp the root concept and not get caught up in the perculiarities of a specific machine/platform as seen in many of the C/C++ answers in the books.

I only put that in there because I asked a like question in a different forum and got all sorts of "use C++" or "use LISP" answers.

  • Comment on Re: Re: Benchmarking with Memory Profiling

Replies are listed 'Best First'.
Re: Re: Re: Benchmarking with Memory Profiling
by ZZamboni (Curate) on Jun 10, 2001 at 07:47 UTC
    I only put that in there because I asked a like question in a different forum and got all sorts of "use C++" or "use LISP" answers.
    And that's why I qualified "when studying algorithms". Because there are some things for which other languages may be more appropriate as a studying ground. For example, if you are studying programming languages theory, it might be better to stick with Scheme or LISP so that you can more easily translate your Lambda calculus and tail recursions and continuations into working code... (and no, I don't want to reopen the "Lisp vs Perl" discussion :-)

    --ZZamboni

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others sharing their wisdom with the Monastery: (3)
As of 2024-04-20 04:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found