Although Abigail is correct (NP complete problems like this one have no efficient solutions for large sets of data), you still can create software which runs it fast.
At least there are two ways to improve it:
- implement and algorithm which is smarter than branch-and-bound. A lot of work, requires sufficient education in programming techniques.
- exchange required computation force with memory consumption. Use Memoize (by MJ Dominous) on KNAP and you'll see the the speed become linear and memory consumption grow exponentially... In some cases, you may be able to buy a sufficient amount of memory to replace unrealistic time to wait. (for instance, for stock calculations, minutes may already be too long to wait)
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|