|
|
|
|
|
by acqq
2747 days ago
|
|
> it was not a competition or contest to be "won" Sure, it wasn't a competition. The fact remains: McIlroy criticized Knuth's presentation of complete algorithms which effectively solved specified problem, by presenting just a sequence of calls which provably have to call the implementations that must implement provably worse algorithms. In the column in ACM whose topic were... algorithms, edited by Jon Bentley. So if you consider that two sides presented their arguments regarding the algorithms related to the specific problem, we can still say that Knuth "won" that "dispute." |
|
You've never really established why this matters given that the goal of the challenge was to present the value of literate programming.
The goal wasn't an optimal algorithm or minimal resource consumption - the goal was to demonstrate the value of literate programming on a small data processing problem.
This is a very different problem than writing an optimal or highly scalable algorithm.