|
|
|
| Syntactic Confectionery Delight | |
| PerlMonks |
Re: Project suggestionsby welchavw (Pilgrim) |
| on May 03, 2006 at 02:45 UTC ( [id://547044]=note: print w/replies, xml ) | Need Help?? |
|
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
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||