Comment Re:Call me conervative, but (Score 4, Informative) 68
I don't think we should be teaching our kids exponential running time O(n^2) algorithms.
Call me liberal, but I don't think we should be teaching our kids improper definitions for "exponential" *or* myths that O(n^2) algorithms like bubble sort are bad.
Quick: which is going to be faster to sort a list of 4 items, bubble sort or randomized partition merge sort? What's that you say? Proper algorithm selection requires more than knee-jerk application of platitudes? Exactly.