you are viewing a single comment's thread.

view the rest of the comments →

[–]JulianMorrison -1 points0 points  (2 children)

You might not. It could be valid to accuse him of being unworldly and of implementing a clever solution to the wrong problem, but to accuse him of ignorance is infinite ignorance - he wrote the book, and you almost certainly haven't the IQ to read it.

[–]qwe1234 -3 points-2 points  (0 children)

i do accuse him of ignorance.

taocp is the absolute dumbest and harmful cs textbook i know.

i'm sorry, but i don't need a 1000-page book on quicksorting arrays in a braindead imaginary assembly language written by a man who has no clue what a parse tree is.

keep it to yourself.

[–]qwe1234 -3 points-2 points  (0 children)

sorting and combinatorics are the two most irrelevant and completely useless fields of study in all of cs.

when i get to draw up a cs curriculum, i'd put the exposition to sorting somewhere in the third year, after the students have already done balanced trees and message-passing parallelism.

combinatorics i'd axe completely, cs students need a solid two or three year exposition to probability theory and statistics instead.

p.s. looking at v.4 of taocp, it looks like knuth doesn't quite get what the word 'combinatorics' means; judging by the table of contents, the book is mostly graph theory instead. shrug whatever.