Folding your merge sort

Back in September 2016, I was lucky enough to attend a talk from Ben Deane entitled std::accumulate: Exploring an Algorithmic Empire. In this talk, he presents the unknown possibilities of std::accumulate, an algorithm also known as fold or reduce depending on the language. The arguments were already quite compelling... then came the slide in which... Continue Reading →

Open recursion (Haskell)

There is a large class of problems that we can solve by nice mathematical recurrence relations. The recurrence is usually simple to read, to reason about, and describes the solution with concision. But a naive translation of this recurrence into code will very often lead to a very inefficient algorithm. When the sub-problems of the... Continue Reading →

Create a website or blog at WordPress.com

Up ↑