Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re^3: Puzzle: Longest Increasing Sequence

by ikegami (Pope)
on Apr 17, 2006 at 16:41 UTC ( #543873=note: print w/ replies, xml ) Need Help??


in reply to Re^2: Puzzle: Longest Increasing Sequence
in thread Puzzle: Longest Increasing Sequence

It is indeed a bug fix, not a typo.

The other thing I did was to clean up the code that builds the return value by using unshift. I no longer needed a counting loop, so I removed the counter variable ("i") and replaced the counting loop with a while loop (implemented as a for loop). "temp" was a bad name — even i, j, etc would be better since temp holds an index — so I renamed it to "i".


Comment on Re^3: Puzzle: Longest Increasing Sequence
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (5)
As of 2015-07-07 03:09 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 (86 votes), past polls