I know, I know...comparing apples and oranges here. Just thought I would share an interesting stat though, as it does pertain to a question that I posted in here about a problem I had with RAM being devoured in a Perl script I wrote.
I wrote 2 similar progs...one in Perl, the other in C++. They both factor numbers. Using 100 million, Perl found all factors in 2 minutes and 28 seconds. C++ did the same in 18 seconds. I am bringing this up because I had a big problem involving using an array with a huge amount of elements, and I couldn't figure out what was eating RAM. I had been jumping back and forth between C++ and Perl lately, and since I never had this problem with C++ arrays, I totally overlooked it in Perl!lol
Although my benchmark test of 'speed' doesn't necessarily have to corrolate with RAM, it's just the whole principle of realizing your limitations on what you are working with. And actually, 'limitations' is not the correct term here, as after posting my problem the other day, many of you showed me another way of fixing my problem easily using the substr function...TIM TOWTDI to the rescue!lol
Anyways, thanks to all for the advice. The prog I was working on in which I initially posted about is a pretty cool encryption system written fully in Perl. Well it is now complete and up and running online. I also made a standalone of it for download. Check it out here if ya want:
http://www.trixmaster.com/designs/encrypter.pl
Thanks again,
David
edited: Sat Aug 3 21:50:38 2002 by jeffa - fixed borked link