Daan Kolthof

When we use graph-based data in our programs, we need to decide on the best way to structure, represent and store information on these graphs. Furthermore, we need to use certain algorithms to process the…

Most modern programming languages simplify multi-threading and parallelism by offering asynchronous computation functionality. This functionality allows a programmer to run certain logic in other/multiple threads and retrieve the results of this logic with ease. Examples…

Many applications within distributed networks require some sort of coordinator and/or leader to work. An example of this would a distributed database, where a coordinator controls which nodes within the network contain what data. One…

When writing large scale software, caching is a valuable technique that offers more rapid lookup of data. Caches, especially in-memory key-value stores, provide a quick and easy way to retrieve values given a certain key….

This article will discuss trees, binary search trees and algorithms related to these data structures. A binary search tree is a tree-based data structure that keeps its nodes in sorted order. The exact workings of…

Finding a string within another string is something you do quite often when programming. In this post, I will discuss some well-known string-matching algorithms, present their theoretical performance, and measure them in practice. I will…

If you have written even the simplest C/C++ program, you have probably come across file reading/writing, either through classes like ifstream (C++) or by using operating system calls like open and read. In this blogpost,…

A Bloom filter is a data structure that keeps track of objects without actually storing them. In this post, I will discuss the exact workings of a bloom filter, including its use in practice. After…

The spaceship operator has finally been incorporated into the standard library. Very soon you will be able to use this new operator for classes like vector, string, array and others. This has not gone without…