Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: The PerlMonks algorithm

by jeffenstein (Monk)
on May 06, 2002 at 09:37 UTC ( #164262=note: print w/ replies, xml ) Need Help??

in reply to The PerlMonks algorithm

I heard a story once about a computer lab in a university. Perhaps it's urban legend, but I'll repeat it here anyway.

The instructors had placed a stuffed bear near their desk in the lab. Before a student could ask the instructor a question, the student must explain the problem to the bear. Nine times out of ten, the student would see the problem while explaining it to the bear, and not need to ask the instructor.

Comment on Re: The PerlMonks algorithm

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://164262]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (9)
As of 2015-11-26 14:03 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (701 votes), past polls