Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re^3: highest value in hash (virtual teddybear)

by Anonymous Monk
on Mar 31, 2013 at 04:41 UTC ( #1026333=note: print w/ replies, xml ) Need Help??


in reply to Re^2: highest value in hash (key is not value)
in thread highest value in hash

Wow, I was trying to figure that out for the longest time and now that you pointed out what I was doing it's so obviouse. duh! Thanks everyone!

No problemo :)

I used the virtual teddybear method

Basically, I read your program aloud , in my head (virtual), until i said "highest becomes key if highest lessthan value"

Actually I said "highest is" but "becomes" sounds better -- I'm not very disciplined when it comes to speaking code

Also known as teddy bear debugging , mirror debugging, empty room debugging, talking to yourself, Rubber Duck method of debugging, say it out loud George, sing into that hairbrush ...


Comment on Re^3: highest value in hash (virtual teddybear)

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (12)
As of 2015-07-31 10:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (276 votes), past polls