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.