*Moved to General Discussions*

Printable View

- 04-21-2009laserlight
*Moved to General Discussions*

- 04-21-2009Snafuist
- 04-21-2009whiteflags
Eh, your painting readers and authors with a wide paintbrush there. I find a contradiction that how an algorithm is presented doesn't matter to you but you are here defending a specific approach. This topic in particular is similar to floating point in that you do not need to understand how floating point works internally to use it on a regular basis but knowing how it works is still imperative, because it is easy to abuse a specific circumstance.

That egghead stuff is actually asymptotic analysis, and as you will see notations around other resources to detail an algorithm's run time, it is important to understand. No, the explanation does not need to be complex or even that correct in a mathematical sense. That's why computer science is applied science. You may not even rely on a deep mathematical understanding unless the platform demands that you be stringent with your choices (such as programming a wristwatch). But you should know enough to know what O(n) means and how to classify your own algorithms as O(n). Hence there are nontechnical resources in some texts and online besides technical ones.

That does not make in-depth resources bad or "the worst way to go about it." It depends on the reader's aptitude and circumstance.

edit:**fsx**was not looking for an algorithm book or anything like that. We're off topic.