Xavier Geerinck

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

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

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 This algorithm works by using increments, the increments can be found here. For this Article I will

Selection Sort Selection Sort is a really easy to implement sorting algorithm, due to being inefficient on large datasets this algorithm is mostly used when memory is limited. How Selection sort work by having a list of numbers, it then goes through the list and finds the minimum number. When

QuickSort is also a Divide And Conquer algorithm with a performance of $O(n * log(n))$, however in the worst case this becomes $O(n^2)$. How We start by picking an element which is called the pivot, then we will rearrange the array so that every element smaller than

Merge Sort is a comparison algorithm that tries to sort the dataset by a Divide And Conquer method. The performance of this algorithm is $O(n*log(n))$. How We start by splitting the array up into separate elements, then we start by merging pairs together and we make sure