Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses

Re: So what is your Perl book "Trilogy" anyway?

by biohisham (Priest)
on Apr 05, 2010 at 07:38 UTC ( #832776=note: print w/replies, xml ) Need Help??

in reply to So what is your Perl book "Trilogy" anyway?

For me, it has been : The Perl Black Book is a trilogy o' trilogies, for therein you got inductions into Tk, Web programming and CGI each on their own right among other assortments. The daunting thing is, it maybe of a considerable volume, and the positive thing which has been for me is that, it cuts the beating-around-the-bush and it doesn't have exercises, I think this is great because examples sort of tame your horizon from expanding on heuristics, after all, what The Monastery is all about if it gives not the day to day cases met by a lot of monks for other monks to dig in as sources of various examples and cases... I also like the book for it has characters in it:
  • The Programming Style Correctness Czar.
  • The ironic strong-personality Big Boss, Mr BB, with his monocle and cigar and strong C programming know-hows.
  • The Novice Programmer, Mr NP, who repeatedly gets himself in coding troubles and who hilariously fears Mr BB.
  • You, who started novice and progressively began to save the poor NP from the organization predators and dodge Mr BB merciless attacks on Perl by showing him what Perl can do when compared to C and where it does stand unique among the rest of the lot, TIMTOWTDI nature and the inherent memory allocation are some of the reply-backs.
It is a great reference and problem solver and that can be extended to become a fun text-book indeed of > 1200 pages....

Excellence is an Endeavor of Persistence. Chance Favors a Prepared Mind.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://832776]
[Eily]: the demonstration itself is fairly easy. The number of paths on a node is the sum of the numbers of paths to the two nodes above (or one node above on the edges of the triangle)
[Eily]: since the value of a node is also the sum from the two nodes above, you just have to demonstrate that the equality is true at the top of the triangle
[Discipulus]: yes Eily, thanks oiskuu but i dont get it.. ;=( maybe I'll ask a SOPW
[LanX]: all combinations with same amount of left and right?
[Eily]: if you want to store in a structure with the coordinates as key, arrays might do, since the keys are going to be 0..n
[LanX]: (Pascale path)
[Eily]: paths like that
[Discipulus]: yes Eily++ (very keen) I want to integrate my project with a 17th experiments. I want to colorize in sequence all paths
[oiskuu]: Yeah, modifry the recursive func combinations() to return not the number, but the paths themselves.
[Eily]: Discipulus I'd do that by starting from the bottom node I think. That way it can inherit the paths from the two nodes above (and so on, recursively)

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (9)
As of 2018-03-19 11:16 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.