# Xavier Geerinck - Blog

My thoughts, tutorials and learnings

azure coding-c
An E2E Azure Sphere project in the area of Smart Retail (RFID RC522, AVNet MT3620 SK, Izokee Display)

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

Xavier Geerinck

azure coding-csharp
Utilizing OpenCV in C# .NET Core to grab frames from a video

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…

Xavier Geerinck

coding coding-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…

Xavier Geerinck

algorithms coding-cpp

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

Xavier Geerinck

algorithms coding-cpp
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…

Xavier Geerinck

algorithms coding-cpp
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…

Xavier Geerinck

algorithms coding-cpp
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…

Xavier Geerinck

algorithms coding-cpp
Floyd Warshall Algorithm

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

Xavier Geerinck

algorithms coding-cpp
Depth First Search (DFS)

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

Xavier Geerinck

algorithms coding-cpp

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

Xavier Geerinck

algorithms coding-cpp
Sorting Algorithm - Shell Sort

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

Xavier Geerinck

algorithms coding-cpp
Sorting Algorithm - Selection Sort

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

Xavier Geerinck

algorithms coding-cpp
Sorting Algorithm - Quick Sort

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…

Xavier Geerinck

algorithms coding-cpp
Sorting Algorithm - Merge Sort

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

Xavier Geerinck

algorithms coding-cpp
Sorting Algorithm - Insertion Sort

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

Xavier Geerinck

algorithms coding-cpp
Sorting Algorithm - Heap Sort

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

Xavier Geerinck

coding coding-cpp
Max number with pipes in C++ and Unix

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…

Xavier Geerinck

coding coding-cpp

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

Xavier Geerinck

coding coding-cpp
How to benchmark Reading 10MB in C++