Mergesort - Githubissues

This PR extends the project by the merge sort algorithm. The algorithm does the workies like this: The array is split recursive into smaller and smaller parts until broken down to one or no element arrays. This arrays then are merged by itterating over both arrays and placing them in the result array according to the sorting order. The resulting (now bigger array) is then passed up the recursive chain and the process repeated, until the first layer of recursion is reached and the final merge resturns the now sorted array.

FaSe22 / phpalgorithms

Mergesort #7