Hacker News new | ask | show | jobs
Functional Pearl No.2 – The Max Number of Surpassers (typeocaml.com)
22 points by jacksontale 4134 days ago
3 comments
dcre 4134 days ago
Enjoyable article, but that two-column layout is bizarre.
link
tel 4134 days ago
If you like this then you should check out the source, Richard Bird's book [0] for it and many other similar examples.

[0] http://www.amazon.com/Pearls-Functional-Algorithm-Design-Ric...

link
jacksontale 4134 days ago
Yeah, I formally introduced the book when I presented the pearl 1: http://typeocaml.com/2015/02/02/functional-pearl-no-1-the-mi...
link
pronoiac 4134 days ago
If we're targeting O(n log n), we could just sort the array and examine the number of times the minimum entry appears.
link
dcre 4134 days ago
The answer is not always the lowest number, e.g., if it appears late in the list.
link
pronoiac 4134 days ago
Ah! I missed the "whose indices are bigger" item in the description.
link
oltmang 4134 days ago
Crap, me too! It also would've helped if he provided an example where the answer wasn't also the min.
link
jacksontale 4134 days ago
Yeah, you are right, the example number list in the post was not that awesome. If I am free at any time, i will modify the example. Just refining the diagram will be quite painful.
link