Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Donald Knuth was framed.
The shell script sorts all the words (and then all the counts), so has complexity at least O(n log n) in the number of words.
It seems to me an optimal solution could be faster, and I wonder what Knuth implemented.
The shell script sorts all the words (and then all the counts), so has complexity at least O(n log n) in the number of words.
It seems to me an optimal solution could be faster, and I wonder what Knuth implemented.