June 5, 2015 | algorithms cpp

Inverting a binary tree in C++

So not so long ago (10th of June) Max Howell tweeted a post stating:

June 5, 2015 | algorithms 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 numbered from easy to hard so that you are able to learn the most critical sorting algorithms first. Also please note that all the code written here has been written by my (unless specified otherwise), because of this there might be some bugs, please contact me if you find any.

June 5, 2015 | algorithms cpp

Floyd Warshall Algorithm

## Introduction

June 5, 2015 | algorithms 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 horribly slow. The recommendation is to use this algorithm when you are sorting really small tables (< 10). Insertion Sort is also used as the base for more advanced algorithms (merge-sort, quick-sort).

June 5, 2015 | algorithms cpp

Sorting Algorithm - Heap Sort

# Heap Sort

June 5, 2015 | 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 and sends the children the process id of the winning child. If the winning child recognises itself then it prints that it is the winner, else they print the winning process id.