Henry Wong wrote:
Pat Farrell wrote:Any serious study of algorithms needs at least some level of calculus and....
Personally, in over 20 years as a developer, I had to use calculus only once...
For sure, the study of algorithms needs a bit of calculus, but in the real world, you rarely need to prove that your algorithm is O(n^2)
I do think that academic study is important in practice, so that you know that using a O(N^4) algorithm is a really bad thing if N is greater than about 5.
I have managed folks with MS in Computer Science that didn't fully grok this. Its like seven way RDBMS joins, sure, they work in theory, but they are way bad in practice.