News for hackers. Stuff that matters.

A comment on Should CS students be graded on performance?. Parent comment

Re:Should CS students be graded on performance? by kd0amg on Sunday March 06, 2011 @01:25AM (#2293628)
Do you mean something like the case of quicksort mentioned in the post?[1] I was taught average- and best-case analysis along with worst-case analysis. Or do you mean some other fact not revealed by that analysis?

[1] "Quicksort is a magical algorithm that theory tells us runs in O(n^2)"

[ Parent | on HN ]
Re:Should CS students be graded on performance? by drfugly on Sunday March 06, 2011 @01:59AM (#2293677)
Right, but there is also the cases where a nlg(n) quicksort for the most part is slower than the O(n^2) version in the real world. I wonder if current CS teaching is completely ignoring real-word performance.
[ Parent | on HN ]