HN Explorer

jacksontale

↗ HN profile [ 46.9 ms ] full profile
Karma
128
Created
February 13, 2015 (11y ago)
Submissions
0
  1. Pearl No. 4 – Kth Smallest in the Union of Two Sorted Collections (typeocaml.com)
    61 points 17
  2. Visualize Randomness in OCaml (typeocaml.com)
    14 points 8
  3. Generating Permutations (typeocaml.com)
    5 points 4
  4. Functional Pearl No.3 – Saddleback Search (typeocaml.com)
    10 points 0
  5. Binomial Heap in OCaml (typeocaml.com)
    78 points 13
  6. Functional Heap – Leftist Tree (typeocaml.com)
    9 points 0
  7. Recursive Memoize and Untying the Recursive Knot (typeocaml.com)
    1 points 0
  8. Functional Pearl No.2 – The Max Number of Surpassers (typeocaml.com)
    22 points 8
  9. Functional Pearl No.2 – The Max Number of Surpassers (typeocaml.com)
    3 points 0
  10. Recursive Memoize and Untying the Recursive Knot (typeocaml.com)
    1 points 0