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

RE: (tye)Re: Packaging Algorithm

by extremely (Priest)
on Nov 08, 2000 at 07:09 UTC ( #40462=note: print w/ replies, xml ) Need Help??


in reply to (tye)Re: Packaging Algorithm
in thread Packaging Algorithm

You've just traded fewer iterations for a more complex inner loop. My point was and still is that the job doesn't have a clean strategy to "solving" it. Thus brute force, however fancy you choose to get, still multiplies quickly to the not-in-my-lifetime stage. Of course that is what you wound up saying too. =) {and I did say you could be fancy with the code, just that it just gains you a few packages}.

Also, I still say it doens't matter how many different sizes of box there are in the world. He didn't ask that question. No matter tho, it's just beating a dead horse.

--
$you = new YOU;
honk() if $you->love(perl)


Comment on RE: (tye)Re: Packaging Algorithm

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (7)
As of 2015-07-02 04:02 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 (27 votes), past polls