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


by chaggalag (Initiate)
on Jul 11, 2006 at 17:40 UTC ( #560524=user: print w/replies, xml ) Need Help??

For all the years I've been a geek, I've never felt comfy learning to code until now. I've been pulling computers out of dumpters for years and making them into happy Linux boxes but it stops there. Hardware I dig. Ones and zeroes I get. High-level coding? Uhhh...

So I'm finally ready to apply what I know. I fathom return codes and stimulus-response in an electronic environment. I can deal with this.

Mind you: I'm a geek by experience and not by education. That means I'm watching and learning more than I want to stick my nose in it. I do enough of that in the real world. I had a revelation recently. I finally came to understand the inner meaning of a subroutine as a black box with a slot door. I'd explain but it's kinda silly. Let's just say: I read Perl code now and I can grok what it wants to do. I'm able to write stuff. I seek wisdom on this path...

Log In?

What's my password?
Create A New User
Discipulus stopped with turkisk spices anyway.. but better hashes than arrays!
[oiskuu]: Discipulus, from the edge or from the top?
[Discipulus]: oiskuu from the top aka 0-0 coords
[LanX]: edge or node?
[oiskuu]: from each height difference, there's a fixed number of "moves right" - "moves left". So it's a number of combinations.
[Discipulus]: I already know how much distinct paths exists but to demonstrate the property i want to have them all
[oiskuu]: ie C(n, k); where n is height difference, k is position in the line
[Discipulus]: infact there are 70 distinct path to reach the tale wich holds 70

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

    Results (239 votes). Check out past polls.