jacksontale

6 ms·

1.
by jacksontale 9y ago
Edited the post and added your comment
2.
by jacksontale 9y ago
Good thought, and also if k < N / 2
3.
by jacksontale 9y ago
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.
4.
by jacksontale 9y ago
Sorry for the confusion. You are absolutely right. I just copy/paste the original problem statement in the book. Will change
5.
Pearl No. 4 – Kth Smallest in the Union of Two Sorted Collections(typeocaml.com)
61 points by jacksontale 9y ago|16 comments
6.
by jacksontale 11y ago
But anyway, I updated teh post, so people could be aware of this diff.
7.
by jacksontale 11y ago
ah ok, thanks.
8.
by jacksontale 11y ago
Just tried, but seems not that different ---------------- PNG: https://raw.githubusercontent.com/MassD/typeocaml_code/maste... ------------- JPG: https://raw.githubusercontent.com/MassD/typeoc
9.
by jacksontale 11y ago
Can I know why?
10.
Visualize Randomness in OCaml(typeocaml.com)
14 points by jacksontale 11y ago|8 comments
11.
by jacksontale 11y ago
Yeah, factoradic is awesome.
12.
Generating Permutations(typeocaml.com)
5 points by jacksontale 11y ago|3 comments
13.
Functional Pearl No.3 – Saddleback Search(typeocaml.com)
10 points by jacksontale 12y ago|0 comments
14.
by jacksontale 12y ago
I think its SML in the book
15.
by jacksontale 12y ago
Yeah that book is one of the most important book in functional world
16.
Binomial Heap in OCaml(typeocaml.com)
78 points by jacksontale 12y ago|13 comments
17.
Functional Heap – Leftist Tree(typeocaml.com)
9 points by jacksontale 12y ago|0 comments
18.
by jacksontale 12y 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.
19.
by jacksontale 12y 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...
20.
Recursive Memoize and Untying the Recursive Knot(typeocaml.com)
1 points by jacksontale 12y ago|0 comments
21.
Functional Pearl No.2 – The Max Number of Surpassers(typeocaml.com)
22 points by jacksontale 12y ago|8 comments
22.
by jacksontale 12y ago
Hi, I was using pure functional programming style, so list only.
23.
Functional Pearl No.2 – The Max Number of Surpassers(typeocaml.com)
3 points by jacksontale 12y ago|0 comments
24.
Recursive Memoize and Untying the Recursive Knot(typeocaml.com)
1 points by jacksontale 12y ago|0 comments
25.
by jacksontale 12y ago
Yeah, you are right, I should have mentioned that.