Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: The fickleness of Reputation

by geektron (Curate)
on Apr 06, 2001 at 05:47 UTC ( #70376=note: print w/ replies, xml ) Need Help??


in reply to The fickleness of Reputation

you have a valid point re: reputation, but you're leaving one thing out

who would you rather get advice from -- someone who can blather on about high-level ( or low-level ), obscure mathematical and quantum topics, or someone who has demonstrated a solid working knowledge of the language in question? reputation ( as i see it ) isn't intended as a show-off factor.

granted, i'd rather have both, but if i need to know why if ( int(rand) ) is always false, i don't want to hear about how i can create an alternate solution that's O(log(n)) rather than the O(n) solution i was working on. . . .

( esp. since O notation is completely lost on me. . . :-)


Comment on Re: The fickleness of Reputation

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (7)
As of 2014-08-29 04:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (275 votes), past polls