Sign in Subscribe

Xavier Geerinck

Finding smallest and biggest number multithreaded in C++

Finding smallest and biggest number multithreaded in C++

The goal of this exercise is to create a program that generates a table with random elements in it. Once we created this table we have to start 2 threads. 1 thread will find the biggest number and the other will find the smallest number. We will then send this

Simulating mkdir -p in bash

Simulating mkdir -p in bash

When we are working with systems that do not support special cases then we need to simulate. That is why it is handy to create different simulations of already existing solutions. In this case we will create a solution that is going to replicate the mkdir -p command in bash.

Solving permutations with Heap's Algorithm in Javascript

Solving permutations with Heap's Algorithm in Javascript

A friend of mine had just gotten the question to find every combination for a given array in [1, 2, 3]. When analyzing this question I found out that this is actually a simple permutation that has to be generated with the use of Javascript. Lucky for me we had

Radix Sort

Radix Sort

Radix sort is a sorting algorithm that is different than the traditional algoritms that we encountered already. It sorts data based on the integers their individual digits instead of looking at the complete value. In this article I will explain the Least Significant Digit Radix Sort by use of an

Prim's Algorithm

Prim's Algorithm

Prim's algorithm solves problems such as finding the Minimum Spanning Tree (MST) of a graph. With a MST we mean the solution set that connects every node of a graph together with the least weight. let's say for example that you want to every major city

Inverting a binary tree in C++

Inverting a binary tree in C++

So not so long ago (10th of June) Max Howell tweeted a post stating: Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off. This post got me started for solving this particular problem because

Introduction to Algorithms

Introduction to Algorithms

In the last semester of school we are learning about datastructures and algorithms. Because this is a very popular subject for companies, I have decided to write articles about it. They will be numbered from easy to hard so that you are able to learn the most critical sorting algorithms