## Trees and binary search trees

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…

Skip to content
# Daan Kolthof

## Trees and binary search trees

## Common string-matching algorithms: theoretical and practical performance

## Asynchronous file I/O on Linux: the epoll API

## Implementing a simple, high-performance Bloom filter in C++

## The C++20 spaceship operator and its implementation in the standard library

Programming and other interesting stuff

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…