I've found myself asking quite the same questions.
Most of the algorithm books you can find are full of math, and you can't read them as an Asimov novel.
But there are some rare jewels that explain you also the algorithm ideas in clear words. I've found so few of them. That is very difficult, because explaining such algorithm often requires abstract concepts based on others, which in turn, ...
Nevertheless, I think the math part is important to catch the algorithm performance, complexity, "degree of fit" (can't find a better english expression for this, sorry) for your application, etc ...
-
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.
|