Robert Sedgewick would disagree with Hal Abelson. Just because some people tend to use pure maths to analyze the run-time of algorithms, doesn't mean we can't

Robert Sedgewick would disagree with Hal Abelson. Just because some people tend to use pure maths to analyze the run-time of algorithms, doesn't mean we can't apply the scientific method to the problem. Here's a nice presentation by Sedgewick where he shows how we can apply the scientific method to programming: http://www.cs.princeton.edu/~rs/talks/ScienceCS10.pdf http://www.cs.princeton.edu/~rs/talks/ScienceCS10.pdf And quote: > Algorithm designer who does not experiment gets lost in abstraction > Software developer who ignores cost risks catastrophic consequences