Earlier quoted context omitted.
A well-taught computer science course will not force anyone to rote-learn algorithms. Instead it ought to walk the students through the discovery process of improving from a naive but simple bubble sort, through more complicated algorithms. Once they understand the complexities, they can appreciate the genius of quicksort. And with the sort problem well established in their minds, they're ready to appreciate the valu…
>A well-taught computer science course will not force anyone to rote-learn algorithms. Agree but with the correction that you mean well-structured computer science course. The UK national A-level syllabus for "Decision 1", that which is under discussion, largely demands rote-learning for the examination. To avoid this, for whatever reason, would be very poor teaching. There are structural deficiencies here, which tea…
10 years later, however, most of it spent doing literature degrees, I remember a lot more integral calculus than box-filling.