Algorithms 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

Algorithms, Coding-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

Algorithms, Coding-cpp 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

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 connects every node of a graph together with the

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 you can’t invert a binary tree on

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 have decided to write articles about it. They will be

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 is one). The algorithm works by starting from a graph matrix (n

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 solve complex problems such as maze solving, maze generation, … Here I

Algorithms, Coding-cpp 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

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 partially sorted data so that insertion sort may work faster. How