Blog

The OCaml Planet RSS

Articles and videos contributed by both experts, companies and passionate developers from the OCaml community. From in-depth technical articles, project highlights, community news, or insights into Open Source projects, the OCaml Planet RSS feed aggregator has something for everyone.

Type

All Article Video

Source

Tarides 227 Anil Madhavapeddy's Blog 220 Watch OCaml 204 Caml Weekly News 188 OCamlPro 170 Marc Elvers 147 Jane Street Tech Blog 124 MirageOS 79 Coq 78 Frama-C 76 Robur Cooperative 70 Caml INRIA 53 Jon Ludlam's Blog at recoil.org 53 Daniel Bünzli 42 David Allsopp's Blog 31

Keyword

opam 281 compiler 200 mirageos 195 dune 185 functional programming 162 ppx 132 unikernel 132 async 125 multicore 123 functor 115 eio 114 parser 114 odoc 112 domain 104 effect 103 merlin 103 lwt 102 monad 99 js_of_ocaml 89 concurrency 88 smallest 0

Year

2026 312 2025 425 2024 306 2023 242 2022 149 2021 196 2020 141 2019 117 2018 110 2017 99 2016 99 2015 105 2014 137 2013 98 2012 60 2011 52 2010 72 2009 35 2008 19 2007 9 2006 3 2005 4 2004 4 2003 2 2002 2

Author

Anil Madhavapeddy 234 Tarides 226 Unknown 213 Caml Weekly News 181 Mark Elvers 147 Jane Street Tech Blog 112 Coq 78 Frama-C 74 Jane Street 70 Robur Cooperative 70 Jon Ludlam 54 Caml INRIA 53 Daniel Bünzli 42 Bozhidar Batsov 28 Mathématiques et informatique - Collège de France 28

Want your Blog Posts or Videos to Show Here?

To contribute a blog post, or add your RSS feed, check out the Contributing Guide on GitHub.

Add your RSS feed!
Filtering by: Keyword: smallest (remove) Clear all
Pearl No.4 - Kth Smallest in the Union of 2 Sorted Collections

Here is the Pearl No.4: Let A and B be two disjoint ordered collections with distinct elements inside. Their combined size is greater than k. A and B are sorted, but the underlying data structures are not specified as...

collections element kth merge middle pearl rank search smallest sorted

19 Oct 2017

Xinuo Chen

Read Article
Three uses for a binary heap

Lately I have been interviewing for jobs, so doing a lot of whiteboard programming, and binary heaps keep arising in the solutions to these...

arr buildings compare elt heap heights len peek_min smallest take_min

25 Nov 2010

Jake Donham

Read Article
camel head illustration

[ARTICLE]