Xavier Geerinck - Blog

Smart Retail with the AVNet MT3620 Starter Kit and an NFC scanner Avnet just released an MT3620 Azure Sphere Development Kit with a contest…

While working on a blog post where I was utilizing .NET Core I wanted to be able to utilize OpenCV. OpenCV is a library of functions that…

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…

Radix sort is a sorting algorithm that is different than the traditional algoritms that we encountered already. It sorts data based on the…

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…

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…

In the last semester of school we are learning about datastructures and algorithms. Because this is a very popular subject for companies, I…

Introduction The Floyd-Warshall algorithm is an algorithm used for finding the shortest paths in a weighted graph (just as Prim’s Algorithm…

Depth-First search and Breadth-First search are search algorithms that help us traversing trees and graphs. We can use these algorithms to…

Depth-First search and Breadth-First search are search algorithms that help us traversing trees and graphs. We can use these algorithms to…

Shell Sort is a more refined version of insertion sort. This algorithm will change our array from completely random unsorted data to…

Selection Sort Selection Sort is a really easy to implement sorting algorithm, due to being inefficient on large datasets this algorithm is…

QuickSort is also a Divide And Conquer algorithm with a performance of , however in the worst case this becomes . How We start by picking an…

Merge Sort is a comparison algorithm that tries to sort the dataset by a Divide And Conquer method. The performance of this algorithm is…

Insertion sort is the core algorithm to know, it is also the easiest to understand and implement. The disadvantages however are that it is…

Heap Sort Heap sort works by using the heap datastructure. This sorting algorithm has a performance of which makes it fast. How Heapsort…

Let’s say we have x children, these x children all generate a number and give this to the parent. The parent now finds the highest number…

Linked Lists are one of the fundamental data structures. The main usage of a Linked List is when constant insertion and deletion time is…

This article is based on a vagrant Ubuntu system with an SSD so you might encounter different results. When reading and writing files in C…

This article is going to explain 1 example of an Object Oriented Program for C++. We will create a small program that allows us to create…