Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Project suggestions

by welchavw (Pilgrim)
on May 03, 2006 at 02:45 UTC ( #547044=note: print w/replies, xml ) Need Help??


in reply to Project suggestions

When learning a new language, I typically re-write "classical" algorithms in the new language. This might be a good start for you, too?

1. Towers of Hanoi (recursion in the language)

2. Starving Philosophers (concurrency in the language)

3. Sorts (bubble, merge, qsort)

4. Data structs (binary tree, hash-table) (re-implement these using Perl hashes - just for learning)

,welchavw

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://547044]
help
Chatterbox?
[r@j]: guys i am begginer on perl and above code is not working on window environment.kindly suggest which support on both window and Unix environment
[holli]: And I kindly suggest you post a question, instead of spamming the chetterbox
[holli]: my spelling... can you actually aquire dyslexia?
[LanX]: SoPW = Seekers of Perl Wisdom, the section for asking and answering general Perl questions. A form for asking a new Perl question can be found at the bottom of that page. (Be sure to read Posting on PerlMonks before posting!)

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (14)
As of 2017-10-23 15:29 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My fridge is mostly full of:

















    Results (280 votes). Check out past polls.

    Notices?