4 ms·
Me thinks we see different naive python on the regular. Because I wouldn't be shocked to see many flat out failures. That said https://www.amazon.com/Exercise
by taeric 3y ago
Me thinks we see different naive python on the regular. Because I wouldn't be shocked to see many flat out failures.
That said https://www.amazon.com/Exercises-Programming-Style-Cristina-Videira/dp/0367350203 https://www.amazon.com/Exercises-Programming-Style-Cristina-... is a good sized book that is nothing but takes on this program from different styles. It is amusing how far you can take that.
Which... is kind of the point of the Knuth solution here. It was a pedagogical exercise. As much to show how literate programs can be presented as it was to "solve" the stated problem.
Edit: It occurs to me you could be referring to the pipeline version. Which, yeah, I don't think that really changes my post. :D. The final paragraph would be changed to the point of the Milroy's code is to get the answer, not to have a library function that is expected to be used again and again on input.
- tyingq 3y agoYes, I was talking about the pipeline version. Last time this came up, I tried a simple perl script[1] and it was quite a lot faster than the pipeline. Even without using a heap to further limit the sorting. [1] https://news.ycombinator.com/item?id=30038415 https://news.ycombinator.com/item?id=30038415