jacksontale

Edited the post and added your comment

Good thought, and also if k < N / 2

This blog post is about using OCaml to solve the Pearl No. 4 in the book of "Pearls of Functional Algorithm Design, by Richard Bird".

I am very keen to OCaml and so using OCaml to solve various algorithm problems to have some fun.

Sorry for the confusion. You are absolutely right. I just copy/paste the original problem statement in the book.

Will change

But anyway, I updated teh post, so people could be aware of this diff.

ah ok, thanks.

Just tried, but seems not that different

----------------

PNG:

https://raw.githubusercontent.com/MassD/typeocaml_code/maste...

-------------

JPG:

https://raw.githubusercontent.com/MassD/typeocaml_code/maste...

Can I know why?

Yeah, factoradic is awesome.

I think its SML in the book

Yeah that book is one of the most important book in functional world

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.

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

Hi, I was using pure functional programming style, so list only.

Yeah, you are right, I should have mentioned that.