Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re: Re: SPOILERS Re: (OT) Interview questions -- your response?

by perrin (Chancellor)
on Sep 03, 2002 at 19:49 UTC ( #194885=note: print w/replies, xml ) Need Help??


in reply to Re: •SPOILERS Re: (OT) Interview questions -- your response?
in thread (OT) Interview questions -- your response?

I like merlyn's answer because it's readable, even by people who are not hardcore perl programmers. It's not tricky, but it doesn't need to be.
  • Comment on Re: Re: SPOILERS Re: (OT) Interview questions -- your response?

Replies are listed 'Best First'.
Re: Re: Re: SPOILERS Re: (OT) Interview questions -- your response?
by demerphq (Chancellor) on Sep 04, 2002 at 08:55 UTC
    Actually I disagree quite strongly. Its readable by people with a C background (ie who are used to the while() loops being disguised as for() loops) but to people who come from other backgrounds (such as Pascal) I think the above would cause some palpatations on first reading.

    Yves / DeMerphq
    ---
    Software Engineering is Programming when you can't. -- E. W. Dijkstra (RIP)

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (7)
As of 2019-10-18 20:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?