15 posts

## Ordinary Least Squares (OLS)

Let's start by defining the goal of our algorithm, what do we want to achieve with our OLS algorithm? Well if we have data points in a region (or XY-axis), then we want to be able to find an equation that fits as closely to these points as possible. We...

## 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 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 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 of Mexico but by...

## 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

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...

## 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 is one). The algorithm works by starting from a graph matrix (n x m size) and then iterating for every row and column pair in this graph. For every...

## 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 solve complex problems such as maze solving, maze generation, … Here I will explain how both these algorithms work and how their pseudocode works for the tree version and the...

## Breadth First Search (BFS)

Depth-First search and Breadth-First search are search algorithms that help us traversing trees and graphs. We can use these algorithms to solve complex problems such as maze solving, maze generation, … Here I will explain how both these algorithms work and how their pseudocode works for the tree version and the...

You’ve successfully subscribed to Xavier Geerinck
Welcome back! You’ve successfully signed in.
Great! You’ve successfully signed up.
Success! Your email is updated.