Hacker News new | past | comments | ask | show | jobs | submit login
Functional Pearl No.2 – The Max Number of Surpassers (typeocaml.com)
22 points by jacksontale on Feb 24, 2015 | hide | past | favorite | 8 comments



Enjoyable article, but that two-column layout is bizarre.


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...


Yeah, I formally introduced the book when I presented the pearl 1: http://typeocaml.com/2015/02/02/functional-pearl-no-1-the-mi...


If we're targeting O(n log n), we could just sort the array and examine the number of times the minimum entry appears.


The answer is not always the lowest number, e.g., if it appears late in the list.


Ah! I missed the "whose indices are bigger" item in the description.


Crap, me too! It also would've helped if he provided an example where the answer wasn't also the min.


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.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: